Modeling soft unloading constraints in the multi-drop container loading problem

DOI10.1016/J.EJOR.2022.10.033MaRDI QIDQ6167417zbMATH OpenFDO

Authors Guillem Bonet Filella, Alessio Trivella, Francesco Corman

Publication date 10 July 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/J.EJOR.2022.10.033

zbMATH Keywords

container loadingimprovement heuristicmixed-integer programmingmulti-drop shipmentspacking

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A comparative review of 3D container loading algorithms
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
• A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
• A maximal-space algorithm for the container loading problem
• A tree search algorithm for solving the container loading problem
• An analytical model for the container loading problem
• An efficient approach for the multi-pallet loading problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• An improved typology of cutting and packing problems
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• Constraints in container loading -- a state-of-the-art review
• Container loading with multi-drop constraints
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
• Extreme point-based heuristics for three-dimensional bin packing
• Heuristics for the container loading problem
• Loading plates with non-identical items
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• MIP-based approaches for the container loading problem with multi-drop constraints
• Neighborhood structures for the container loading problem: a VNS implementation
• On the three-dimensional container packing problem under home delivery service
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Routing problems with loading constraints
• Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban
• The airline container loading problem with pickup and delivery
• The load-balanced multi-dimensional bin-packing problem
• The Three-Dimensional Bin Packing Problem
• Three-dimensional container loading models with cargo stability and load bearing constraints
• VCS: A new heuristic function for selecting boxes in the single container loading problem
• Vehicle routing problems with loading constraints: state-of-the-art and future directions
• Weight distribution considerations in container loading

Cited in

(6)

• MIP-based approaches for the container loading problem with multi-drop constraints
• A three-dimensional multiple containers loading approach considering weak heterogeneous containers for multiple customers
• Solving capacitated vehicle routing problem with three-dimensional loading and relocation constraints
• Two-phase matheuristic for assignment and truck loading problems
• Solving a large-scale 3D packing problem with robot constraints
• A tree search-based heuristic for the three-dimensional single container loading problem

This page was built for publication: Modeling soft unloading constraints in the multi-drop container loading problem

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