Research in metaheuristics for combinatorial optimization problems has lately experienced
a noteworthy shift towards the hybridization of metaheuristics with other techniques for …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

The combination of components from different algorithms is currently one of the most
successful trends in optimization. The hybridization of metaheuristics such as ant colony …

We propose exact algorithms for the two-dimensional strip packing problem (2SP) with and
without 90° rotations. We first focus on the perfect packing problem (PP), which is a special …

Bin packing problem (BPP) is one of the fastest-growing research issues within the field of
combinatorial optimization. Over the last years, several studies carried out various BPP …

We investigate the best-fit heuristic algorithm by Burke et al.[2004. A new placement
heuristic for the orthogonal stock-cutting problem. Operations Research 52, 655–671] for the …

This paper studies a yard management problem in an automotive transshipment terminal.
Groups of cars arrive to and depart from the terminal in a given planning period. These …

In a non-guillotinable rectangular strip packing problem (RF-SPP), the best orthogonal
placement of given rectangular pieces on a strip of stock sheet having fixed width and …

Given a set of rectangles and a rectangular container with a fixed width, called a strip, the
two-dimensional strip packing problem (2SP) requires all the given rectangles to be placed …

The rectangle packing area minimization problem is a key sub-problem of floorplanning in
VLSI design. This problem places a set of axis aligned two-dimensional rectangular items of …