Solving packing problems by a distributed global optimization algorithm
Summary: Packing optimization problems aim to seek the best way of placing a given set of rectangular boxes within a minimum volume rectangular box. Current packing optimization methods either find it difficult to obtain an optimal solution or require too many extra 0-1 variables in the solution process. This study develops a novel method to convert the nonlinear objective function in a packing program into an increasing function with single variable and two fixed parameters. The original packing program then becomes a linear program promising to obtain a global optimum. Such a linear program is decomposed into several subproblems by specifying various parameter values, which is solvable simultaneously by a distributed computation algorithm. A reference solution obtained by applying a genetic algorithm is used as an upper bound of the optimal solution, used to reduce the entire search region.
- A distributed global optimization method for packing problems
- An efficient deterministic optimization approach for rectangular packing problems
- A finite method of searching for the global minimum of the rectangular packing problem
- A global optimization algorithm for the three-dimensional packing problem
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- A distributed global optimization method for packing problems
- A global search framework for practical three-dimensional packing with variable carton orientations
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- A particular approach for the three-dimensional packing problem with additional constraints
- A three-dimensional pallet loading method for single-size boxes
- An algorithm for the two-dimensional assortment problem
- An analytical model for the container loading problem
- An approximately global optimization method for assortment problems
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- An efficient approach for the multi-pallet loading problem
- An efficient deterministic optimization approach for rectangular packing problems
- An improved typology of cutting and packing problems
- Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Three-dimensional bin packing problem with variable bin height
- Three-dimensional packings with rotations
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Optimal packing using the multiple mating method
- An efficient deterministic optimization approach for rectangular packing problems
- A finite method of searching for the global minimum of the rectangular packing problem
- Application of particle swarm optimization to packing problem
- Optimization algorithms for packing of small-lot correspondence in communication networks
- A distributed global optimization method for packing problems
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
- A dynamic packing approach for Internet-of-Things and logistics applications
This page was built for publication: Solving packing problems by a distributed global optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955364)
