Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban

DOI10.1016/j.ejor.2017.05.034zbMath1380.90051OpenAlexW2618462897MaRDI QIDQ1694323

Dirk Männel, Andreas Bortfeldt

Publication date: 1 February 2018

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.05.034

zbMATH Keywords

transportationvehicle routingpackingpickup and delivery

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (max. 100)

The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ The split delivery vehicle routing problem with time windows and three-dimensional loading constraints ⋮ The static stability of support factor‐based rectangular packings: an assessment by regression analysis ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale

Uses Software

• VRP

Cites Work

• Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
• A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
• Vehicle routing problems with loading constraints: state-of-the-art and future directions
• Constraints in container loading -- a state-of-the-art review
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• Vehicle Routing

This page was built for publication: Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban