The split delivery vehicle routing problem with minimum delivery amounts
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part E: Logistics and Transportation Review.
Volume (Year): 46 (2010)
Issue (Month): 5 (September)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Salani, Matteo & Vacca, Ilaria, 2011. "Branch and price for the vehicle routing problem with discrete split deliveries and time windows," European Journal of Operational Research, Elsevier, vol. 213(3), pages 470-477, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.