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

DOI10.1016/J.EJOR.2021.08.037MaRDI QIDQ2077966zbMATH OpenOpenAlexFDO

Authors S. 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

cuttingfeasibility constraintslookahead searchmatheuristicvariable-sized bin packing

Mathematics Subject Classification ID

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

Recommendations

• The two-dimensional bin packing problem with variable bin sizes and costs
• A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
• A variable neighborhood descent approach for the two-dimensional bin packing problem
• A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
• scientific article; zbMATH DE number 2086931
• A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
• A new variable-sized bin packing problem
• An improved approximation scheme for variable-sized bin packing
• An improved approximation scheme for variable-sized bin packing

Cites work

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

Cited in

(1)

• A matheuristic for the home healthcare routing and scheduling problem with ferry-dependent travel times

Describes a project that uses

Uses Software

• DOGS

This page was built for publication: A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2077966)