A vehicle routing problem with multiple overlapped batches
A vehicle routing problem with multiple overlapped batches
- Neue Suche nach: Yu, Mingzhu
- Neue Suche nach: Qi, Xiangtong
- Neue Suche nach: Yu, Mingzhu
- Neue Suche nach: Qi, Xiangtong
Highlights A real vehicle routing problem with backhaul, time window and multiple batches is considered. The problem includes vehicle assignment to overlapped batches and vehicle routing in batch. We develop two tabu search algorithms to handle the problem. We study the algorithm efficiency, tradeoff between traveling cost and customer service.
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.
Dokumentinformationen
A vehicle routing problem with multiple overlapped batches
2013-10-16
16 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Ähnliche Titel
A vehicle routing problem with multiple overlapped batches
| Online Contents | 2014
Dynamic Vehicle Routing Problem with Multiple Objectives
| Transportation Research Record | 2005
MOUNTING APPARATUS FOR MULTIPLE BATCHES OF SMALL TIRES
| Europäisches Patentamt | 2022
Installation equipment of multiple batches of small tires
| Europäisches Patentamt | 2020