Space defragmentation for packing problems

DOI10.1016/J.EJOR.2012.05.031MaRDI QIDQ1926954zbMATH OpenOpenAlexFDO

Authors Wenbin Zhu, Zhaoyi Zhang, Wee-Chong Oon, Andrew Lim

Publication date 29 December 2012

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

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

zbMATH Keywords

2D/3D bin packingbin shufflingcomparability graphpackingspace defragmentationvisibility graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• On some packing problem related to dynamic storage allocation
• Optimal allocation of storage space
• Exactly solving packing problems with fragmentation
• Dynamic storage allocation with limited compaction - complexity and some practical implications
• Analysis of space allocation in a generally fragmented linear store
• scientific article; zbMATH DE number 1830744
• scientific article; zbMATH DE number 2086236
• Packing arrays
• Algorithms for packing problems

Cites work

• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• A maximal-space algorithm for the container loading problem
• A set-covering-based heuristic approach for bin-packing problems
• A tree search algorithm for solving the container loading problem
• A typology of cutting and packing problems
• An improved typology of cutting and packing problems
• An optimal algorithm for rectangle placement
• Berth management in container terminal: the template design problem
• Exact solution of the two-dimensional finite bin packing problem
• Extreme point-based heuristics for three-dimensional bin packing
• Guided local search for the three-dimensional bin-packing problem
• Heuristic algorithms for the three-dimensional bin packing problem
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• On-line scheduling of parallel jobs in a list
• Orthogonal Packings in Two Dimensions
• The multiple container loading cost minimization problem
• The Three-Dimensional Bin Packing Problem
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• The two-dimensional finite bin packing problem. II: New lower and upper bounds
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• Two-Dimensional Finite Bin-Packing Algorithms

Cited in

(4)

• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
• The pallet loading problem: three-dimensional bin packing with practical constraints
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem

Describes a project that uses

Uses Software

• Algorithm 864
• Ts2pack

This page was built for publication: Space defragmentation for packing problems

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