A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem

DOI10.1016/J.EJOR.2014.02.008MaRDI QIDQ296576zbMATH OpenOpenAlexFDO

Authors Yiping Lu, Jianzhong Cha

Publication date 23 June 2016

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

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

zbMATH Keywords

equivalence classpackingpallet loading problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete geometry (52C99) Discrete location and assignment (90B80)

Recommendations

• The minimum size instance of a Pallet Loading Problem equivalence class
• Solving the pallet loading problem
• A fast algorithm for two-dimensional pallet loading problems of large size
• An exact depth-first algorithm for the pallet loading problem
• A tabu search algorithm for the pallet loading problem

Cites work

• A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
• A branch-and-cut algorithm for the pallet loading problem
• A fast algorithm for two-dimensional pallet loading problems of large size
• A note on an L-approach for solving the manufacturer's pallet loading problem
• A simple and effective recursive procedure for the manufacturer's pallet loading problem
• A typology of cutting and packing problems
• An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
• An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
• An exact algorithm for the pallet loading problem
• An improved typology of cutting and packing problems
• Analysis of upper bounds for the pallet loading problem
• Computing stable loads for pallets
• Constraints in container loading -- a state-of-the-art review
• Determining an upper bound for a class of rectangular packing problems
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
• Practical Considerations of the Pallet-Loading Problem
• Solving the pallet loading problem
• Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
• The G4-Heuristic for the Pallet Loading Problem
• The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
• The minimum size instance of a Pallet Loading Problem equivalence class

Cited in

(2)

• A heuristic algorithm for container loading of pallets with infill boxes
• The minimum size instance of a Pallet Loading Problem equivalence class

This page was built for publication: A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem

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