A container loading problem MILP-based heuristics solved by CPLEX: an experimental analysis

DOI10.1007/978-3-319-18899-7_7MaRDI QIDQ4634976zbMATH OpenOpenAlexFDO

Authors Stefano Gliozzi, A. Castellazzo, Giorgio Fasano

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

zbMATH Keywords

computational resultscontainer loadingCPLEXheuristicsMILP modelmixed integer linear programmingorthogonal packing with rotations

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Recommendations

• Packing problems in space solved by CPLEX: an experimental analysis
• MIP-based approaches for the container loading problem with multi-drop constraints
• The exact solutions of several types of container loading problems
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Heuristics for the container loading problem

Cites work

• Benchmarking Derivative-Free Optimization Algorithms
• CAST: a successful project in support of the international space station logistics
• Constraints in container loading -- a state-of-the-art review
• Heuristics for the container loading problem
• Optimized packings with applications
• Solving Non-standard Packing Problems by Global Optimization and Heuristics

Cited in

(2)

• Packing problems in space solved by CPLEX: an experimental analysis
• A modeling-based approach for non-standard packing problems

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A container loading problem MILP-based heuristics solved by CPLEX: an experimental analysis

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