A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts

作者：Xiong Yupei; Gulczynski Damon^*; Kleitman Daniel; Golden Bruce; Wasil Edward

来源：Optimization Letters, 2013, 7(7): 1597-1609.

DOI：10.1007/s11590-012-0554-9

• Vehicle routing
• Split deliveries
• Minimum delivery amounts
• Worst-case analysis

In the vehicle routing problem (VRP), a fleet of vehicles must service the demands of customers in a least-cost way. In the split delivery vehicle routing problem (SDVRP), multiple vehicles can service the same customer by splitting the deliveries. By allowing split deliveries, savings in travel costs of up to 50 % are possible, and this bound is tight. Recently, a variant of the SDVRP, the split delivery vehicle routing problem with minimum delivery amounts (SDVRP-MDA), has been introduced. In the SDVRP-MDA, split deliveries are allowed only if at least a minimum fraction of a customer's demand is delivered by each visiting vehicle. We perform a worst-case analysis on the SDVRP-MDA to determine tight bounds on the maximum possible savings.

• 出版日期2013-10