The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results

DOI10.1002/net.20181zbMath1141.90335MaRDI QIDQ5295488

Bruce L. Golden, Edward A. Wasil, Si Chen

Publication date: 30 July 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20181

zbMATH Keywords

heuristics; integer programming; vehicle routing problem

Mathematics Subject Classification ID

90C10: Integer programming

90B06: Transportation, logistics and supply chain management

Related Items

A column generation approach for the split delivery vehicle routing problem, Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem, An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems, An adaptive memory algorithm for the split delivery vehicle routing problem, Improved lower bounds for the split delivery vehicle routing problem, Branch and price for the vehicle routing problem with discrete Split deliveries and time windows, A two-stage vehicle routing model for large-scale bioterrorism emergencies, The Split Delivery Vehicle Routing Problem: A Survey

Cites Work

• Mixed binary integer programming formulations for the reentrant job shop scheduling problem
• Split delivery routing