A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

被引：0
|
作者：
Michael Polacek
Richard F. Hartl
Karl Doerner
Marc Reimann
机构：
[1] University of Vienna,Department of Production and Operations Management, Institute of Management Science
[2] ETH Zurich,Institute for Operations Research
来源：
Journal of Heuristics | 2004年 / 10卷
关键词：
Metaheuristic; Variable Neighborhood Search; VNS; Multi Depot Vehicle Routing Problem with Time Windows; MDVRPTW;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.
引用
收藏
页码：613 / 627
页数：14
相关论文
共 50 条
  • [1] A variable neighborhood search for the multi depot vehicle routing problem with time windows
    Polacek, M
    Hartl, RF
    Doerner, K
    [J]. JOURNAL OF HEURISTICS, 2004, 10 (06) : 613 - 627
  • [2] A lightweight genetic algorithm with variable neighborhood search for multi-depot vehicle routing problem with time windows
    Su, Yukang
    Zhang, Shuo
    Zhang, Chengning
    [J]. APPLIED SOFT COMPUTING, 2024, 161
  • [3] An adaptive large neighborhood search for the multi-depot dynamic vehicle routing problem with time windows
    Wang, Sihan
    Sun, Wei
    Huang, Min
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2024, 191
  • [4] A variable neighborhood search for the multi-depot vehicle routing problem with loading cost
    Kuo, Yiyo
    Wang, Chi-Chang
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (08) : 6949 - 6954
  • [5] An Improved Variable Neighborhood Search for the Open Vehicle Routing Problem with Time Windows
    Redi, A. A. N. Perwira
    Maghfiroh, Meilinda F. N.
    Yu, Vincent F.
    [J]. 2013 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM 2013), 2013, : 1641 - 1645
  • [6] Variable Neighborhood Search for a Dynamic Rich Vehicle Routing Problem with time windows
    de Armas, Jesica
    Melian-Batista, Belen
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 85 : 120 - 131
  • [7] A Variable Neighborhood Search for the Vehicle Routing Problem with Occasional Drivers and Time Windows
    Macrina, Giusy
    Pugliese, Luigi Di Puglia
    Guerriero, Francesca
    [J]. PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES), 2020, : 270 - 277
  • [8] A reactive variable neighborhood search for the vehicle-routing problem with time windows
    Bräysy, O
    [J]. INFORMS JOURNAL ON COMPUTING, 2003, 15 (04) : 347 - 368
  • [9] A hybrid variable neighborhood search approach for the multi-depot green vehicle routing problem
    Sadati, Mir Ehsan Hesam
    Catay, Bulent
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2021, 149 (149)
  • [10] An adaptive large neighborhood search for the larger-scale multi depot green vehicle routing problem with time windows
    Wen, Muyang
    Sun, Wei
    Yu, Yang
    Tang, Jiafu
    Ikou, Kaku
    [J]. JOURNAL OF CLEANER PRODUCTION, 2022, 374
12345