Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

DOI10.1287/ijoc.11.4.345zbMath1034.90500MaRDI QIDQ4427380

Silvano Martello, Andrea Lodi, Daniele Vigo

Publication date: 6 November 2003

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.11.4.345

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

90Bxx: Operations research and management science

Related Items

Recent advances on two-dimensional bin packing problems, Characterization and modelling of guillotine constraints, A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem, Ant colony optimization for the two-dimensional loading vehicle routing problem, A least wasted first heuristic algorithm for the rectangular packing problem, A lower bound for the non-oriented two-dimensional bin packing problem, New lower bounds for the three-dimensional finite bin packing problem, Two-dimensional packing problems: a survey, Heuristic algorithms for the three-dimensional bin packing problem, A guided tabu search for the vehicle routing problem with two-dimensional loading constraints, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, New resolution algorithm and pretreatments for the two-dimensional bin-packing problem, Improved local search algorithms for the rectangle packing problem with general spatial costs, A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces, The two-dimensional bin packing problem with variable bin sizes and costs, Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A new exact method for the two-dimensional orthogonal packing problem, Models and algorithms for three-stage two-dimensional bin packing, Analysis of distributed genetic algorithms for solving cutting problems