An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations

DOI10.1016/J.COR.2021.105550MaRDI QIDQ2669649zbMATH OpenOpenAlexFDO

Authors Hao Zhang, Qiang Liu, Lijun Wei, Jiawei Zeng, Jiewu Leng, Duxi Yan

Publication date 9 March 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2021.105550

zbMATH Keywords

irregular bin packinglocal searchpacking

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Matheuristics for the irregular bin packing problem with free rotations
• Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins
• An effective heuristic for the two-dimensional irregular bin packing problem
• A beam search approach to solve the convex irregular bin packing problem with guillotine guts
• Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints

Cites work

• A beam search approach to solve the convex irregular bin packing problem with guillotine guts
• A clique covering MIP model for the irregular strip packing problem
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
• A tutorial in irregular shape packing problems
• An effective heuristic for the two-dimensional irregular bin packing problem
• An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
• An improved typology of cutting and packing problems
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems
• Irregular packing problems: a review of mathematical models
• Local search algorithms for the bin packing problem and their relationships to various construction heuristics
• Matheuristics for the irregular bin packing problem with free rotations
• On genetic algorithms for the packing of polygons
• On the limited memory BFGS method for large scale optimization
• Raster penetration map applied to the irregular packing problem
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(7)

• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
• Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins
• Matheuristics for the irregular bin packing problem with free rotations
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
• An effective heuristic for the two-dimensional irregular bin packing problem
• Heuristics for the two-dimensional irregular bin packing problem with limited rotations
• An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry

Describes a project that uses

Uses Software

• L-BFGS

This page was built for publication: An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations

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