A global optimization approach for solving three-dimensional open dimension rectangular packing problems
From MaRDI portal
Publication:3453421
DOI10.1080/02331934.2013.877906zbMath1328.49034OpenAlexW1999284538MaRDI QIDQ3453421
Pei-Chun Wang, Ming-Hua Lin, Jung-Fa Tsai
Publication date: 27 November 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.877906
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)
Related Items (8)
Global optimization for the three-dimensional open-dimension rectangular packing problem ⋮ Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement ⋮ Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Approximate and exact merging of knapsack constraints with cover inequalities ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
Uses Software
Cites Work
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- A particular approach for the three-dimensional packing problem with additional constraints
- An analytical model for the container loading problem
- Packing small boxes into a big box.
- A global optimization algorithm for the three-dimensional packing problem
- MIP-based approaches for the container loading problem with multi-drop constraints
- Three-dimensional container loading models with cargo stability and load bearing constraints
- An exact algorithm for the pallet loading problem
- Heuristics for the container loading problem
- Solving container loading problems by block arrangement
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
- A prototype column generation strategy for the multiple container loading problem
- An improved typology of cutting and packing problems
- A heuristic for the three-dimensional strip packing problem
- An efficient deterministic optimization approach for rectangular packing problems
- ON THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM UNDER HOME DELIVERY SERVICE
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- A distributed global optimization method for packing problems
- Analysis of upper bounds for the pallet loading problem
This page was built for publication: A global optimization approach for solving three-dimensional open dimension rectangular packing problems
