A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows

被引：108
|
作者：
Belhaiza, Slim [1 ]
Hansen, Pierre [2 ]
Laporte, Gilbert [3 ,4 ]
机构：
[1] King Fahd Univ Petr & Minerals, Dept Math & Stat, Dhahran 31261, Saudi Arabia
[2] HEC Montreal, Gerad, Montreal, PQ H3T 2A7, Canada
[3] CIRRELT, Montreal, PQ H3T 2A7, Canada
[4] HEC Montreal, Montreal, PQ H3T 2A7, Canada
来源：
COMPUTERS & OPERATIONS RESEARCH | 2014年 / 52卷
基金：
加拿大自然科学与工程研究理事会;
关键词：
Variable neighborhood search; Tabu search; Vehicle routing problem; Multiple time windows; TRAVELING SALESMAN PROBLEM; TEAM ORIENTEERING PROBLEM; CONSTRAINTS; ALGORITHMS;
D O I：
10.1016/j.cor.2013.08.010
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码：269 / 281
页数：13
相关论文
共 50 条
  • [1] A New Hybrid Genetic Variable Neighborhood Search Heuristic for the Vehicle Routing Problem with Multiple Time Windows
    Belhaiza, Slim
    M'Hallah, Rym
    Ben Brahim, Ghassen
    [J]. 2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 1319 - 1326
  • [2] A parallel tabu search heuristic for the vehicle routing problem with time windows
    Badeau, P
    Guertin, F
    Gendreau, M
    Potvin, JY
    Taillard, E
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 1997, 5 (02) : 109 - 122
  • [3] A tabu search heuristic for the vehicle routing problem with soft time windows
    Taillard, E
    Badeau, P
    Gendreau, M
    Guertin, F
    Potvin, JY
    [J]. TRANSPORTATION SCIENCE, 1997, 31 (02) : 170 - 186
  • [4] A tabu search heuristic for the vehicle routing problem with backhauls and time windows
    Duhamel, C
    Potvin, JY
    Rousseau, JM
    [J]. TRANSPORTATION SCIENCE, 1997, 31 (01) : 49 - 59
  • [5] A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
    D. C. Paraskevopoulos
    P. P. Repoussis
    C. D. Tarantilis
    G. Ioannou
    G. P. Prastacos
    [J]. Journal of Heuristics, 2008, 14 : 425 - 455
  • [6] A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
    Paraskevopoulos, D. C.
    Repoussis, P. P.
    Tarantilis, C. D.
    Ioannou, G.
    Prastacos, G. P.
    [J]. JOURNAL OF HEURISTICS, 2008, 14 (05) : 425 - 455
  • [7] A New Tabu Search Heuristic Algorithm for the Vehicle Routing Problem with Time Windows
    Qi Ming-yao
    Miao Li-xin
    Zhang Le
    Xu Hua-yu
    [J]. 2008 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING (15TH), VOLS I AND II, CONFERENCE PROCEEDINGS, 2008, : 1648 - +
  • [8] An incremental tabu search heuristic for the generalized vehicle routing problem with time windows
    Moccia, L.
    Cordeau, J-F
    Laporte, G.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2012, 63 (02) : 232 - 244
  • [9] A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
    Ho, SC
    Haugland, D
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (12) : 1947 - 1964
  • [10] A reactive greedy randomized variable neighborhood Tabu search for the. vehicle routing problem with time windows
    Repoussis, Panagiotis P.
    Paraskevopoulos, Dimitris C.
    Tarantilis, Christos D.
    Ioannou, George
    [J]. HYBRID METAHEURISTICS, PROCEEDINGS, 2006, 4030 : 124 - 138
12345