A Container Loading Problem MILP-Based Heuristics Solved by CPLEX: An Experimental Analysis
DOI10.1007/978-3-319-18899-7_7zbMath1390.90464OpenAlexW2226987593MaRDI QIDQ4634976
Alessandro Castellazzo, Giorgio Fasano, Stefano Gliozzi
Publication date: 13 April 2018
Published in: Optimized Packings with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18899-7_7
heuristicscomputational resultsmixed integer linear programmingMILP modelcontainer loadingCPLEXorthogonal packing with rotations
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Uses Software
Cites Work
- Heuristics for the container loading problem
- Optimized packings with applications
- Constraints in container loading -- a state-of-the-art review
- CAST: A Successful Project in Support of the International Space Station Logistics
- Benchmarking Derivative-Free Optimization Algorithms
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
This page was built for publication: A Container Loading Problem MILP-Based Heuristics Solved by CPLEX: An Experimental Analysis