Solving Non-standard Packing Problems by Global Optimization and Heuristics

DOI10.1007/978-3-319-05005-8MaRDI QIDQ5402137zbMATH OpenOpenAlexFDO

Authors Giorgio Fasano

Publication date 5 March 2014

Published in SpringerBriefs in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-05005-8

zbMATH Keywords

global optimizationheuristicsnon-standard packing problems

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Numerical methods based on nonlinear programming (49M37) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Inventory, storage, reservoirs (90B05) Integer programming (90C10) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Applications of mathematical programming (90C90)

Recommendations

• A global optimization point of view to handle non-standard object packing problems
• MIP-based heuristic for non-standard 3D-packing problems
• A modeling-based approach for non-standard packing problems
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems
• Heuristic algorithm for the rectangular packing problem with static non-equilibrium constraint
• Solving packing problems by a distributed global optimization algorithm
• A global optimization algorithm for the three-dimensional packing problem
• Multistage approach to solving the optimization problem of packing nonconvex polyhedra
• A heuristic for solving large bin packing problems in two and three dimensions

Cited in

(21)

• MIP-based heuristic for non-standard 3D-packing problems
• How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
• A global optimization point of view to handle non-standard object packing problems
• Packing ovals in optimized regular polygons
• Packing ellipsoids in an optimized cylinder
• Multistage approach to solving the optimization problem of packing nonconvex polyhedra
• Packing convex polygons in minimum-perimeter convex hulls
• Model development and solver demonstrations using randomized test problems
• Resource-constrained scheduling with non-constant capacity and non-regular activities
• Packing problems in space solved by CPLEX: an experimental analysis
• A modeling-based approach for non-standard packing problems
• CAST: a successful project in support of the international space station logistics
• A container loading problem MILP-based heuristics solved by CPLEX: an experimental analysis
• Approximate packing: integer programming models, valid inequalities and nesting
• Exploiting packing components in general-purpose integer programming solvers
• Packing circular-like objects in a rectangular container
• Global optimization for the three-dimensional open-dimension rectangular packing problem
• Decomposition algorithm for irregular placement problems
• Scalable enforcement of geometric non-interference constraints for gradient-based optimization

This page was built for publication: Solving Non-standard Packing Problems by Global Optimization and Heuristics

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