Tabu Search heuristics for the Vehicle Routing Problem with Time Windows

被引：21
|
作者：
Olli Bräysy
Michel Gendreau
机构：
[1] SINTEF Applied Mathematics,Department of Optimization
[2] Université de Montréal,Centre de Recherche sur les Transports
来源：
Top | 2002年 / 10卷 / 2期
关键词：
Metaheuristics; tabu search; vehicle routing; time windows; 90B06; 68T20; 90-02;
D O I：
10.1007/BF02579017
中图分类号：
学科分类号：
摘要：
This paper surveys the research on the Tabu Search heuristics for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes for a fleet of vehicles from one depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval; all routes start and end at the depot, and the total demands of all points on one particular route must not exceed the capacity of the vehicle. In addition to describing basic features of each method, experimental results for Solomon’s benchmark test problems are presented and analyzed.
引用
收藏
页码：211 / 237
页数：26
相关论文
共 50 条
  • [1] An improved tabu search for vehicle routing problem with time windows
    Si, Liangsheng
    Li, Jianguo
    [J]. Proceedings of the First International Conference on Information and Management Sciences, 2002, 1 : 112 - 115
  • [2] On the Performance of Tabu Search Algorithm for the Vehicle Routing Problem with time windows
    Kirci, Pinar
    [J]. 2016 IEEE 4TH INTERNATIONAL CONFERENCE ON FUTURE INTERNET OF THINGS AND CLOUD WORKSHOPS (FICLOUDW), 2016, : 351 - 354
  • [3] 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
  • [4] A Hyrid Tabu Search for the Vehicle Routing Problem with Soft Time Windows
    Liang Nai-Wen
    Liu Chang-Shi
    [J]. PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON COMMUNICATION, ELECTRONICS AND AUTOMATION ENGINEERING, 2013, 181 : 507 - +
  • [5] On Open Vehicle Routing Problem with Soft Time Windows and Tabu Search
    Duan Fenghua
    He Xiaonian
    [J]. LOGISTICS RESEARCH AND PRACTICE IN CHINA, 2008, : 295 - +
  • [6] 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
  • [7] 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
  • [8] 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 - +
  • [9] 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
  • [10] 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
12345