On Open Vehicle Routing Problem with Soft Time Windows and Tabu Search

被引:0
|
作者
Duan Fenghua [1 ]
He Xiaonian [2 ]
机构
[1] Cent S Univ, Sch Traff & Transport Engn, Changsha, Hunan, Peoples R China
[2] Hunan Int Econ Univ, Sch Elect & Informat, Changsha 410000, Hunan, Peoples R China
关键词
Vehicle Routing Problem; Open Vehicle Routing Problem; Soft Time Windows; Tabu Search;
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
As a typical NP-hard problem, open vehicle routing problem with soft time windows (OVRPSTW) is a kind of basic open vehicle routing problem with time windows. By setting fit neighbourhood structure, evaluation solutions, tabu list, and stopping criterion, author constructed a tabu search (TS) to solve the OVRPSTW. TS shows its good computational performance by testing benchmark problems.
引用
收藏
页码:295 / +
页数:2
相关论文
共 50 条
  • [1] 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
  • [2] 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 - +
  • [3] Improved tabu search algorithm for the open vehicle routing problem with soft time windows and satisfaction rate
    Yangkun Xia
    Zhuo Fu
    [J]. Cluster Computing, 2019, 22 : 8725 - 8733
  • [4] Improved tabu search algorithm for the open vehicle routing problem with soft time windows and satisfaction rate
    Xia, Yangkun
    Fu, Zhuo
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 4): : S8725 - S8733
  • [5] An Improved Tabu Search Algorithm for the Stochastic Vehicle Routing Problem With Soft Time Windows
    Li, Guoming
    Li, Junhua
    [J]. IEEE ACCESS, 2020, 8 : 158115 - 158124
  • [6] Parallel Tabu Search and the multiobjective Capacitated Vehicle Routing Problem with soft Time Windows
    Beham, Andreas
    [J]. COMPUTER AIDED SYSTEMS THEORY- EUROCAST 2007, 2007, 4739 : 829 - 836
  • [7] Tabu Search heuristics for the Vehicle Routing Problem with Time Windows
    Olli Bräysy
    Michel Gendreau
    [J]. Top, 2002, 10 (2) : 211 - 237
  • [8] 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
  • [9] 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
  • [10] 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