A two-stage packing problem procedure
From MaRDI portal
Publication:2968485
DOI10.1111/itor.12251zbMath1358.90120OpenAlexW2521516528MaRDI QIDQ2968485
Publication date: 16 March 2017
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10773/24159
Related Items
Solving a large multicontainer loading problem in the car manufacturing industry ⋮ The pallet-loading vehicle routing problem with stability constraints ⋮ Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups ⋮ The static stability of support factor‐based rectangular packings: an assessment by regression analysis ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
Cites Work
- A heuristic for solving large bin packing problems in two and three dimensions
- A beam search approach to the container loading problem
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- An integrated approach to the vehicle routing and container loading problems
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- Neighborhood structures for the container loading problem: a VNS implementation
- Constraints in container loading -- a state-of-the-art review
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- An improved typology of cutting and packing problems
- The pallet loading problem: a review of solution methods and computational experiments
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- A Tree Search Algorithm for Solving the Container Loading Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- A Maximal-Space Algorithm for the Container Loading Problem
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- New heuristics for one-dimensional bin-packing
