Vehicle routing with heterogeneous time windows

DOI10.1007/978-3-031-24907-5_21MaRDI QIDQ6606540zbMATH OpenFDO

Authors Petra Mutzel, Tim Niemann, Lukas Schürmann, Sebastian Stiller, Andreas M. Tillmann

Publication date 17 September 2024

zbMATH Keywords

vehicle routing problembranch-and-priceheterogeneous time windows

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• Vehicle Routing with Time Windows
• The discrete time window assignment vehicle routing problem
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows

Cites work

• scientific article; zbMATH DE number 680242 (Why is no real title available?)
• A concise guide to existing and emerging vehicle routing problem variants
• Thirty years of heterogeneous vehicle routing

Cited in

(1)

• Delay-resistant robust vehicle routing with heterogeneous time windows

This page was built for publication: Vehicle routing with heterogeneous time windows

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