摘要
The dynamic vehicle routing problems (DVRP) is an extension of vehicle routing problems (VRP) in order to consider possible variations of travel times in the network. In this research, a two-stage framework for solving dynamic vehicle routing problem is proposed. In the first stage, the sweep method is adopted in vehicle assignment. In the second stage, a tabu search algorithm is implemented to improve routes under real-time information. The framework is implemented in an object-oriented approach and possible benefit from real-time information is illustrated through numerical simulation. The simulation-assignment model, DynaTAIWAN is applied in numerical simulation to evaluate real-time routing strategies in a traffic network. Numerical experiments are conducted in a 50 Nodes Network and a Taichung City. The results show that positive benefits could be achieved through utilization of real-time information with careful design.
| 原文 | English |
|---|---|
| 頁(從 - 到) | 12548-12558 |
| 頁數 | 11 |
| 期刊 | Expert Systems With Applications |
| 卷 | 38 |
| 發行號 | 10 |
| DOIs | |
| 出版狀態 | Published - 2011 9月 15 |
All Science Journal Classification (ASJC) codes
- 一般工程
- 電腦科學應用
- 人工智慧
指紋
深入研究「An object-oriented evaluation framework for dynamic vehicle routing problems under real-time information」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver