Packing Problems in Space Solved by CPLEX: An Experimental Analysis

DOI10.1007/978-3-319-41508-6_5zbMath1380.90194OpenAlexW2571283487MaRDI QIDQ3133910

Giorgio Fasano, Alessandro Castellazzo, Stefano Gliozzi

Publication date: 8 February 2018

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41508-6_5

zbMATH Keywords

heuristicsbalancingcomputational resultsMILP modelcontainer loadingCPLEXtetris-like itemsanalytical cargo accommodationorthogonal packing with rotationssatellite layout

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-phi-functions and optimal packing of ellipses
• On the global minimum in a balanced circular packing problem
• Modeling and optimization in space engineering.
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems
• A heuristic approach for packing identical rectangles in convex regions
• Efficiently packing unequal disks in a circle
• Hybrid metaheuristics. An emerging approach to optimization.
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Cutting circles and polygons from area-minimizing rectangles
• An analytical model for the container loading problem
• On the two-dimensional knapsack problem
• TOPOS -- A new constructive algorithm for nesting problems
• Heuristics for the container loading problem
• Mathematical model and efficient algorithms for object packing problem
• Mixed-integer programming models for nesting problems
• Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
• The two-dimensional bin packing problem with variable bin sizes and costs
• Fast neighborhood search for two- and three-dimensional nesting problems
• A greedy search for the three-dimensional bin packing problem: the packing static stability case
• Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• A tutorial in irregular shape packing problems
• Placement of two- and three-dimensional irregular shapes for inertia moment and balance
• The Three-Dimensional Bin Packing Problem
• Packing Optimization of Free-Form Objects in Engineering Design
• A Modeling-Based Approach for Non-standard Packing Problems
• CAST: A Successful Project in Support of the International Space Station Logistics
• Cutting and Packing Problems with Placement Constraints
• A Container Loading Problem MILP-Based Heuristics Solved by CPLEX: An Experimental Analysis
• Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting
• Optimized Object Packings Using Quasi-Phi-Functions
• Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
• Solving Non-standard Packing Problems by Global Optimization and Heuristics
• Computational Complexity

This page was built for publication: Packing Problems in Space Solved by CPLEX: An Experimental Analysis