Search Results - subject:"Packing problem"

Cutting ellipses from area-minimizing rectangles

Kallrath, Josef; Rebennack, Steffen - In: Journal of Global Optimization 59 (2014) 2, pp. 405-437

A set of ellipses, with given semi-major and semi-minor axes, is to be cut from a rectangular design plate, while minimizing the area of the design rectangle. The design plate is subject to lower and upper bounds of its widths and lengths; the ellipses are free of any orientation restrictions....

Persistent link: https://www.econbiz.de/10010994186

Knapsack problems with sigmoid utilities : approximation algorithms via hybrid optimization

Srivastava, Vaibhav; Bullo, Francesco - In: European journal of operational research : EJOR 236 (2014) 2, pp. 488-498

Persistent link: https://www.econbiz.de/10010366165

Feature issue: Cutting and packing

Wang, Pearl Y. (contributor) - In: European journal of operational research : EJOR 141,2 : Feature issue (2002)

Persistent link: https://www.econbiz.de/10004715319

On-line bin-packing problem : maximizing the number of unused bins

Kouakou, Bernard; Demange, Marc; Soutif, Eric - HAL - 2006

In this paper, we study the on-line version of the bin-packing problem. We analyze the approximation behavior of an on … difficulty of the problem and for the quality of the algorithm developed to solve it. In its off-line version, the bin-packing … problem, BP, is better approximated in differential framework than in standard one. Our objective is to determine if or not …

Persistent link: https://www.econbiz.de/10010750829

Efficient algorithms for the offline variable sized bin-packing problem

Maiza, Mohamed; Labed, Abdenour; Radjef, Mohammed - In: Journal of Global Optimization 57 (2013) 3, pp. 1025-1038

We addresses a variant of the classical one dimensional bin-packing problem where several types of bins with unequal …

Persistent link: https://www.econbiz.de/10010896434

Linear models for the approximate solution of the problem of packing equal circles into a given domain

Galiev, Shamil I.; Lisafina, Maria S. - In: European Journal of Operational Research 230 (2013) 3, pp. 505-514

The linear models for the approximate solution of the problem of packing the maximum number of equal circles of the given radius into a given closed bounded domain G are proposed. We construct a grid in G; the nodes of this grid form a finite set of points T, and it is assumed that the centers...

Persistent link: https://www.econbiz.de/10010871207

Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints

Queiroz, Thiago A. de; Miyazawa, Flávio K. - In: International Journal of Production Economics 145 (2013) 2, pp. 511-530

In the oriented Two-Dimensional Strip Packing Problem (2SP), one has to pack a set of rectangular items into a …

Persistent link: https://www.econbiz.de/10011043285

Understanding the structure of bin packing problems through principal component analysis

López-Camacho, Eunice; Terashima-Marín, Hugo; Ochoa, … - In: International Journal of Production Economics 145 (2013) 2, pp. 488-499

This paper uses a knowledge discovery method, Principal Component Analysis (PCA), to gain a deeper understanding of the structure of bin packing problems and how this relates to the performance of heuristic approaches to solve them. The study considers six heuristics and their combination...

Persistent link: https://www.econbiz.de/10011043334

An emergent computation approach to the problem of polygon layout with performance constraints

Huang, Zhendong; Xiao, Renbin - In: Physica A: Statistical Mechanics and its Applications 392 (2013) 20, pp. 5074-5088

We address the two-dimensional satellite irregular polygons layout problem (TDSIPLP). By mapping the layout problem to a physical system, we present a self-organization emergence algorithm (SEA) based on a multi-agent system (MAS). SEA uses information on the local energy of agents and...

Persistent link: https://www.econbiz.de/10010742314

On-line bin-packing problem : maximizing the number of unused bins.

Kouakou, Bernard; Demange, Marc; Soutif, Eric - Maison des Sciences Économiques, Université Paris 1 … - 2005

In this paper, we study the on-line version of the bin-packing problem. We analyze the approximation behaviour of an on … difficulty of the problem and for the quality of the algorithm developed to solve it. In its off-line version, the bin-packing … problem, BP, is better approximated in differential framework than in standard one. Our objective is to determine if or not …

Persistent link: https://www.econbiz.de/10005510626