A hybrid search method for the vehicle routing problem with time windows

被引：0
|
作者：
Humberto César Brandão de Oliveira
Germano Crispim Vasconcelos
机构：
[1] Federal University of Alfenas,Department of Exact Sciences
[2] Federal University of Pernambuco,Center for Informatics
来源：
Annals of Operations Research | 2010年 / 180卷
关键词：
Vehicle routing problems; Hybrid systems; Optimization; Simulated annealing;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Vehicle Routing Problems have been extensively analyzed to reduce transportation costs. More particularly, the Vehicle Routing Problem with Time Windows (VRPTW) imposes the period of time of customer availability as a constraint, a common characteristic in real world situations. Using minimization of the total distance as the main objective to be fulfilled, this work implements an efficient algorithm which associates non-monotonic Simulated Annealing to Hill-Climbing and Random Restart. The algorithm is compared to the best results published in the literature for the 56 Solomon instances and it is shown how statistical methods can be used to boost the performance of the method.
引用
收藏
页码：125 / 144
页数：19
相关论文
共 50 条
  • [21] HYBRID HEURISTICS FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS
    RUSSELL, RA
    [J]. TRANSPORTATION SCIENCE, 1995, 29 (02) : 156 - 166
  • [22] Research on Vehicle Routing Problem with Soft Time Windows Based on Hybrid Tabu Search and Scatter Search Algorithm
    Ge, Jinhui
    Liu, Xiaoliang
    Liang, Guo
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 64 (03): : 1945 - 1958
  • [23] Method for vehicle routing problem with multiple vehicle types and time windows
    Liu, Fuh-Hwa
    Shen, Sheng-Yuan
    [J]. Proceedings of the National Science Council, Republic of China, Part A: Physical Science and Engineering, 1999, 23 (04): : 526 - 536
  • [24] 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
  • [25] 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
  • [26] Indirect search for the vehicle routing problem with pickup and delivery and time windows
    Ulrich Derigs
    Thomas Döhmer
    [J]. OR Spectrum, 2008, 30 : 149 - 165
  • [27] Tabu search heuristic for the vehicle routing problem with backhauls and time windows
    Lab d'Informatique et de, Modelisation des Systemes, Aubiere, France
    [J]. Transp Sci, 1 (49-59):
  • [28] A Large Neighborhood Search for the Vehicle Routing Problem with Multiple Time Windows
    Schaap, Hendrik
    Schiffer, Maximilian
    Schneider, Michael
    Walther, Grit
    [J]. TRANSPORTATION SCIENCE, 2022, : 1369 - 1392
  • [29] Indirect search for the vehicle routing problem with pickup and delivery and time windows
    Derigs, Ulrich
    Doehmer, Thomas
    [J]. OR SPECTRUM, 2008, 30 (01) : 149 - 165
  • [30] 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 - +
12345