Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints

DOI10.14232/actacyb.20.1.2011.3zbMath1240.90037OpenAlexW2293629177MaRDI QIDQ3106200

Tamás Bartók, Csanád Imreh

Publication date: 19 December 2011

Published in: Acta Cybernetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14232/actacyb.20.1.2011.3

zbMATH Keywords

vehicle routingmultidimensional packing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (6)

The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints ⋮ Variable neighborhood search algorithms for pickup and delivery problems with loading constraints ⋮ Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls ⋮ Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints

This page was built for publication: Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints