A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem

DOI10.1016/j.ejor.2021.08.037zbMath1495.90162OpenAlexW3198389926MaRDI QIDQ2077966

Sergey Polyakovskiy, Rym M'Hallah

Publication date: 23 February 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.08.037

zbMATH Keywords

cuttingmatheuristicvariable-sized bin packingfeasibility constraintslookahead search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• DOGS

Cites Work

• Unnamed Item
• A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Recent advances on two-dimensional bin packing problems
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• An agent-based approach to the two-dimensional guillotine bin packing problem
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
• Models and algorithms for optimising two-dimensional LEGO constructions
• An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
• A bin packing approach to solve the aircraft maintenance task allocation problem
• Solving a large cutting problem in the glass manufacturing industry
• A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
• Solving the variable size bin packing problem with discretized formulations
• The two-dimensional bin packing problem with variable bin sizes and costs
• Sequential heuristic for the two-dimensional bin-packing problem
• Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
• A matheuristic for the air transportation freight forwarder service problem
• Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
• Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
• Two-Dimensional Finite Bin-Packing Algorithms
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing