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

DOI10.1287/IJOC.11.4.345zbMath1034.90500OpenAlexW2049791651MaRDI 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

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Operations research and management science (90Bxx)

Related Items (86)

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints ⋮ A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ A block-based layer building approach for the 2D guillotine strip packing problem ⋮ A heuristic for solving large bin packing problems in two and three dimensions ⋮ Constrained order packing: comparison of heuristic approaches for a new bin packing problem ⋮ A hybrid algorithm for constrained order packing ⋮ Sequential heuristic for the two-dimensional bin-packing problem ⋮ A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang ⋮ A variable neighborhood descent approach for the two-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 ⋮ A lower bound for the non-oriented two-dimensional bin packing problem ⋮ An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem ⋮ A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ Adaptive simulated annealing with greedy search for the circle bin packing problem ⋮ The disruptive anti-covering location problem ⋮ The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints ⋮ A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls ⋮ 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 ⋮ An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts ⋮ Models and algorithms for packing rectangles into the smallest square ⋮ Bin packing and related problems: general arc-flow formulation with graph compression ⋮ A three-dimensional bin-packing model: exact multicriteria solution and computational complexity ⋮ Triple-solution approach for the strip packing problem with two-staged patterns ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ Space defragmentation for packing problems ⋮ Routing problems with loading constraints ⋮ Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ A squeaky wheel optimisation methodology for two-dimensional strip packing ⋮ A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict ⋮ Solution validator and visualizer for (combined) vehicle routing and container loading problems ⋮ Maximizing revenue with allocation of multiple advertisements on a Web banner ⋮ A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem ⋮ Metaheuristics for truck loading in the car production industry ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Characterization and modelling of guillotine constraints ⋮ A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem ⋮ A sequential value correction heuristic for a bi-objective two-dimensional bin-packing ⋮ Ant colony optimization for the two-dimensional loading vehicle routing problem ⋮ A beam search approach to solve the convex irregular bin packing problem with guillotine guts ⋮ A least wasted first heuristic algorithm for the rectangular packing problem ⋮ New resolution algorithm and pretreatments for the two-dimensional bin-packing problem ⋮ A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint ⋮ Recent advances on two-dimensional bin packing problems ⋮ 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 ⋮ Bidirectional best-fit heuristic for orthogonal rectangular strip packing ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ Number of bins and maximum lateness minimization in two-dimensional bin packing ⋮ Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows ⋮ Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints ⋮ Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet ⋮ The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ The maximum diversity assortment selection problem ⋮ Models for two-dimensional bin packing problems with customer order spread ⋮ Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings ⋮ An agent-based approach to the two-dimensional guillotine bin packing problem ⋮ Hybrid approach for the two-dimensional bin packing problem with two-staged patterns ⋮ A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem ⋮ A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces ⋮ New lower bounds for the three-dimensional finite bin packing problem ⋮ Metaheuristics for vehicle routing problems with three-dimensional loading constraints ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ 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 ⋮ Analysis of distributed genetic algorithms for solving cutting problems ⋮ Two-dimensional packing problems: a survey ⋮ Heuristic algorithms for the three-dimensional bin packing problem ⋮ 2DPackLib: a two-dimensional cutting and packing library ⋮ Integrated distribution and loading planning via a compact metaheuristic algorithm ⋮ Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints

This page was built for publication: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems