Direct \(k\)-routing versus cross-docking: worst-case results

DOI10.1007/s11590-019-01507-9zbMath1471.90022OpenAlexW3007030872MaRDI QIDQ2037884

Luca Bertazzi, Jeffrey W. Ohlmann

Publication date: 8 July 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-019-01507-9

zbMATH Keywords

vehicle routingworst-case analysiscross-dockdirect delivery

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
• A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
• The vehicle routing problem with drones: several worst-case results
• A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
• The bin packing problem with item fragmentation: a worst-case analysis
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
• Vehicle routing with cross-docking

This page was built for publication: Direct \(k\)-routing versus cross-docking: worst-case results