Multicommodity vs. Single-Commodity Routing
In this paper the authors study a vehicle routing problem where customers request multiple commodities. The authors study the impact on transportation cost from using vehicles dedicated to a single commodity compared with using flexible vehicles capable of carrying any set of commodities. With vehicles that carry multiple commodities, the authors consider when the delivery to a customer can be made by more than one vehicle. If multiple vehicles can be used, the authors examine when deliveries of individual commodities may be split and when they may not be split. The latter problem has not previously been studied, and the authors present a mathematical programming model for it. The authors use worst case and computational analysis to compare these different models.
- Record URL:
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
-
Supplemental Notes:
- Abstracts reprinted with permission of INFORMS (Institute for Operations Research and the Management Sciences, http://www.informs.org).
-
Authors:
- Archetti, Claudia
- Campbell, Ann Melissa
- Speranza, M Grazia
- Publication Date: 2016-5
Language
- English
Media Info
- Media Type: Web
- Features: References;
- Pagination: pp 461-472
-
Serial:
- Transportation Science
- Volume: 50
- Issue Number: 2
- Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
- ISSN: 0041-1655
- Serial URL: http://transci.journal.informs.org/
Subject/Index Terms
- TRT Terms: Commodities; Delivery service; Programming (Mathematics); Routing; Traveling salesman problem
- Uncontrolled Terms: Multicommodity quickest path problem; Split deliveries; Vehicle routing problem
- Subject Areas: Freight Transportation; Highways; Planning and Forecasting;
Filing Info
- Accession Number: 01601127
- Record Type: Publication
- Files: TRIS
- Created Date: May 20 2016 10:44AM