A vehicle routing problem with multiple overlapped batches

Mingzhu Yu and Xiangtong Qi

Transportation Research Part E: Logistics and Transportation Review, 2014, vol. 61, issue C, 40-55

Abstract: This paper considers a vehicle routing problem faced by an express company which tackles complicated operations involving time window constraints, multiple delivery and pick-up customer visits per day, multiple trips per vehicle, and latency cost for each delivery. It is challenging in that it involves multiple delivery and pick-up batches and the time spans of the batches are overlapped. We formally define the problem and develop two tabu search algorithms. By computational experiments, we find one algorithm outperforms the other by getting better solution in much shorter time. Moreover, our approach produces a significant cost saving for the company.

Keywords: Vehicle routing; Multiple batches; Backhauls; Latency cost; Tabu search (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554513001701
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:61:y:2014:i:c:p:40-55

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

DOI: 10.1016/j.tre.2013.10.004

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().