|
|||||
|
|
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows |
|
| Affiliation: | 1. Pamukkale University, Faculty of Engineering, Department of Industrial Engineering, Kinikli, 20070 Denizli, Turkey;2. Seoul National University, College of Engineering, Department of Industrial Engineering, Seoul 151-744, Republic of Korea;1. School of Traffic and Transportation Engineering, Central South University, Changsha 410075, PR China;2. Lancaster University Management School, Lancaster, UK;3. College of Economics and Management, Hengyang Normal University, Hengyang 421008, PR China |
| Abstract: | This paper presents a new hybrid variable neighborhood-tabu search heuristic for the Vehicle Routing Problem with Multiple Time windows. It also proposes a minimum backward time slack algorithm applicable to a multiple time windows environment. This algorithm records the minimum waiting time and the minimum delay during route generation and adjusts the arrival and departure times backward. The implementation of the proposed heuristic is compared to an ant colony heuristic on benchmark instances involving multiple time windows. Computational results on newly generated instances are provided. |
| Keywords: | Variable neighborhood search Tabu search Vehicle routing problem Multiple time windows |
| 本文献已被 ScienceDirect 等数据库收录！ | |