The split delivery vehicle routing problem with minimum delivery amounts |
| |
| Authors: | Damon Gulczynski Bruce Golden Edward Wasil |
| |
| Institution: | 1. Department of Mathematics, University of Maryland, College Park, MD 20742, United States;2. Robert H. Smith School of Business, University of Maryland, College Park, MD 20742, United States;3. Kogod School of Business, American University, Washington, DC 20016, United States |
| |
| Abstract: | In the vehicle routing problem, a fleet of vehicles must service the demands of customers in a least-cost way. By allowing multiple vehicles to service the same customer (i.e., splitting deliveries), substantial savings in travel costs are possible. However, split deliveries are often an inconvenience to the customer who would prefer to have demand serviced in a single visit. We consider the vehicle routing problem in which split deliveries are allowed only if a minimum fraction of a customer’s demand is serviced by a vehicle. We develop a heuristic method for solving this problem and report computational results on a wide range of problem sets. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
