Parallel Tabu Search and the multiobjective Capacitated Vehicle Routing Problem with soft Time Windows

被引：0
|
作者：
Beham, Andreas [1 ]
机构：
[1] Johannes Kepler Univ Linz, Inst Formal Models & Verificat, A-4040 Linz, Austria
来源：
COMPUTER AIDED SYSTEMS THEORY- EUROCAST 2007 | 2007年 / 4739卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows (CVRPsTW). The Tabu Search algorithms are of two kinds: Two of them are parallel with respect to functional decomposition and one approach is a collaborative multisearch TS. The implementation builds upon a framework called Distributed metaheuristics or DEME for short. Tests were performed on an SGI Origin 3800 supercomputer at the Johannes Kepler University of Linz, Austria.
引用
收藏
页码：829 / 836
页数：8
相关论文
共 50 条
  • [21] Improved tabu search algorithm for vehicle routing problem with alternative time windows
    School of Management, Hefei University of Technology, Hefei 230009, China
    [J]. Xitong Fangzhen Xuebao, 2008, 16 (4454-4457):
  • [22] A Beam Search Based Algorithm for the Capacitated Vehicle Routing Problem with Time Windows
    Akeb, Hakim
    Bouchakhchoukha, Adel
    Hifi, Mhand
    [J]. 2013 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2013, : 329 - 336
  • [23] 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
  • [24] 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
  • [25] A tabu search algorithm for the site dependent vehicle routing problem with time windows
    Cordeau, JF
    Laporte, G
    [J]. INFOR, 2001, 39 (03) : 292 - 298
  • [26] A hybrid Tabu search - Variable neighborhood descent algorithm for the cumulative capacitated vehicle routing problem with time windows in humanitarian applications
    Kyriakakis, Nikolaos A.
    Sevastopoulos, Ioannis
    Marinaki, Magdalene
    Marinakis, Yannis
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 164
  • [27] A Multiobjective Large Neighborhood Search Metaheuristic for the Vehicle Routing Problem with Time Windows
    Konstantakopoulos, Grigorios D.
    Gayialis, Sotiris P.
    Kechagias, Evripidis P.
    Papadopoulos, Georgios A.
    Tatsiopoulos, Ilias P.
    [J]. ALGORITHMS, 2020, 13 (10)
  • [28] HYBRIDIZING ANT COLONY SYSTEMS AND TABU SEARCH FOR A VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
    Carlos Figueroa, Juan D.
    Angelica Pinninghoff J, M.
    Contreras A, Ricardo
    [J]. ICAART: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2012, : 469 - 472
  • [29] Tabu search for the time-dependent vehicle routing problem with time windows on a road network
    Gmira, Maha
    Gendreau, Michel
    Lodi, Andrea
    Potvin, Jean-Yves
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 288 (01) : 129 - 140
  • [30] An improved sequential insertion algorithm and tabu search to vehicle routing problem with time windows
    Yue, Bin
    Yang, Jie
    Ma, Junxu
    Shi, Jinfa
    Shangguan, Linjian
    [J]. RAIRO-OPERATIONS RESEARCH, 2024, 58 (02) : 1979 - 1999
12345