This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistent neighborhood, a fitness function including problem knowledge, and a diversification based on the history of the search. The neighborhood only considers valid, sometimes partial, packings. The fitness function incorporates measures related to the empty spaces. Diversifi...

From 13.03. to 16.03.2007, the Dagstuhl Seminar 07112 Cutting, Packing, Layout and Space Allocation was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of semi...

In this paper, an orthogonal strip packing problem with rotation of items and without the guillotine packing constraint is considered. A fast heuristic algorithm for the large-scale problems is presented. This heuristic algorithm is mainly based on heuristic strategies inspired by the wall-building rule of bricklayers in daily life. The heuristics is simple and the setting of parameter is not r...

Multi-dimensional multi-container packing problems appear within many settings of theoretical and practical interest, including Knapsack, Strip Packing, Container Loading, and Scheduling problems. These various problem settings display different objective functions and constraints, which may explain the lack of efficient heuristics able to jointly address them. In this paper we introduce GASP G...

This paper describes a heuristic algorithm for the two-dimensional free-form bin packing (2DFBP) problem, which is also called the irregular cutting and packing, or nesting problem. Given a set of 2D free-form bins, which in practice may be plate materials, and a set of 2D free-form items, which in practice may be plate parts to be cut out of the materials, the 2D-FBP problem is to lay out item...

In this paper, we consider vehicle routing problems with backhauls and time windows (VRPBTW). Different backhaul variants are studied, namely clustered backhauls (CB), mixed linehauls and backhauls, and variants with simultaneous delivery and pickup and with divisible delivery and pickup. Three dimensional loading constraints are assumed. A two-phase approach following the principle packing fir...

Jobs in modern parallel-computing frameworks, such as Hadoop and Spark, are subject to several constraints. In these the data typically distributed across a cluster of machines is processed multiple stages. Therefore, tasks that belong same stage (job) have collective completion time determined by slowest task collection. Furthermore, task’s processing machine dependent, each capable at its cap...

The three dimensional (3D) packing problem is to arrange given rectangular boxes in a rectangular box of the minimum volume without overlapping each other. As an approach, this paper introduces the system of three sequences of the box labels, the sequence-triple, to encode the topology of the 3Dpacking. The topology is the system of relative relations in pairs of boxes such as right-of, above, ...

The genome is packed into the cell nucleus in form of chromatin. Biochemical approaches have revealed that chromatin within domains, which group larger and so forth. Such hierarchical packing equally visible super-resolution microscopy images large-scale organization. While previous work has suggested partitioned distinct domains via microphase separation, it unclear how these organize this pac...