A fast implementation for the 2D/3D box placement problem
From MaRDI portal
Publication:5963685
DOI10.1007/S10589-015-9780-2zbMATH Open1332.90229OpenAlexW1617736874MaRDI QIDQ5963685FDOQ5963685
Zhixing Luo, Andrew Lim, Wee-Chong Oon, Wenbin Zhu
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
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
- On genetic algorithms for the packing of polygons
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- A beam search implementation for the irregular shape packing problem
- Computational geometry. Algorithms and applications.
- Irregular Packing Using the Line and Arc No-Fit Polygon
- Orthogonal Packings in Two Dimensions
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- An effective quasi-human based heuristic for solving the rectangle packing problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
- A (slightly) faster algorithm for klee's measure problem
- Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices
- New Upper Bounds in Klee’s Measure Problem
- The measure problem for rectangular ranges in d-space
- Title not available (Why is that?)
- An optimal algorithm for rectangle placement
Cited In (5)
- 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
- Placing Text Boxes on Graphs
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)
