A fast implementation for the 2D/3D box placement problem

DOI10.1007/S10589-015-9780-2MaRDI QIDQ5963685zbMATH OpenOpenAlexFDO

Authors Wenbin Zhu, Zhixing Luo, Andrew Lim, Wee-Chong Oon

Publication date 23 February 2016

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-015-9780-2

zbMATH Keywords

packingcuttingVLSI layoutrectangle placementbox placement

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• An efficient placement heuristic for three-dimensional rectangular packing
• scientific article; zbMATH DE number 773158
• Implementation of a fast box-counting algorithm
• Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane
• An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem
• An efficient method for the three-dimensional container loading problem by forming box sizes
• A fast algorithm for the path 2-packing problem
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)

Cites work

• scientific article; zbMATH DE number 1302378 (Why is no real title available?)
• A (slightly) faster algorithm for klee's measure problem
• A beam search implementation for the irregular shape packing problem
• A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
• A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
• An effective quasi-human based heuristic for solving the rectangle packing problem
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• An optimal algorithm for rectangle placement
• Computational geometry. Algorithms and applications.
• Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
• Irregular packing using the line and arc no-fit polygon
• New Upper Bounds in Klee’s Measure Problem
• On genetic algorithms for the packing of polygons
• Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices
• Orthogonal Packings in Two Dimensions
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• The measure problem for rectangular ranges in d-space

Cited in

(5)

• Placing Text Boxes on Graphs
• 3D dynamic heterogeneous robotic palletization problem
• Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)
• Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane

This page was built for publication: A fast implementation for the 2D/3D box placement problem

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