Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks

被引：41
|
作者：
Yu, Vincent F. [1 ,2 ]
Jewpanya, Parida [3 ]
Redi, A. A. N. Perwira [4 ]
Tsao, Yu-Chung [1 ]
机构：
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, 43,Sect 4,Keelung Rd, Taipei 10607, Taiwan
[2] Natl Taiwan Univ Sci & Technol, Ctr Cyber Phys Syst Innovat, 43,Sect 4,Keelung Rd, Taipei 10607, Taiwan
[3] Rajamangala Univ Technol Lanna, Dept Ind Engn, Tak, Thailand
[4] Bina Nusantara Univ, Ind Engn Dept, BINUS Grad Program Master Ind Engn, Jakarta 11480, Indonesia
来源：
COMPUTERS & OPERATIONS RESEARCH | 2021年 / 129卷
关键词：
Adaptive Neighborhood; Cross-docking; Heterogeneous fleet; Simulated annealing; Vehicle routing problem; SCHEDULING PROBLEM; DELIVERY PROBLEM; SEARCH; PICKUP; ALGORITHM; SYSTEMS; OPTIMIZATION; TRUCKS;
D O I：
10.1016/j.cor.2020.105205
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper introduces the heterogeneous fleet vehicle routing problem with multiple cross-docks, a variant of the vehicle routing problem with cross-docking, which considers the use of multiple cross-docks and a heterogeneous fleet of vehicles in a distribution system. A mixed integer linear program and an adaptive neighborhood simulated annealing algorithm are developed for the problem. The proposed algorithm is a new variant of the simulated annealing algorithm that implements an adaptive mechanism for selecting neighborhood moves in order to improve the solution. Results of computational study show the excellent performance of the proposed algorithm in terms of solution quality and computational efficiency. (C) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数：19
相关论文
共 50 条
  • [21] A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
    D. C. Paraskevopoulos
    P. P. Repoussis
    C. D. Tarantilis
    G. Ioannou
    G. P. Prastacos
    Journal of Heuristics, 2008, 14 : 425 - 455
  • [22] Enhanced simulated annealing in the vehicle routing problem
    Ipatov, A. V.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2011, 17 (04): : 121 - 125
  • [23] An adaptive large neighborhood search for a vehicle routing problem with multiple routes
    Azi, Nabila
    Gendreau, Michel
    Potvin, Jean-Yves
    COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 167 - 173
  • [24] The Heterogeneous Fleet Vehicle Routing Problem with Draft Limits
    Fadda, Paolo
    Mancini, Simona
    Serra, Patrizia
    Fancello, Gianfranco
    COMPUTERS & OPERATIONS RESEARCH, 2023, 149
  • [25] A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem
    Subramanian, Anand
    Vaz Penna, Puca Huachi
    Uchoa, Eduardo
    Ochi, Luiz Satoru
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 221 (02) : 285 - 295
  • [26] Vehicle routing problem with a heterogeneous fleet and time windows
    Jiang, Jun
    Ng, Kien Ming
    Poh, Kim Leng
    Teo, Kwong Meng
    EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (08) : 3748 - 3760
  • [27] The mixed fleet vehicle routing problem with partial recharging by multiple chargers: Mathematical model and adaptive large neighborhood search
    Donmez, Sercan
    Koc, Cagri
    Altiparmak, Fulya
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2022, 167
  • [28] A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
    Tavakkoli-Moghaddam, R.
    Safaei, N.
    Kah, M. M. O.
    Rabbani, M.
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2007, 344 (05): : 406 - 425
  • [29] The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation
    Salhi, Said
    Imran, Arif
    Wassan, Niaz A.
    COMPUTERS & OPERATIONS RESEARCH, 2014, 52 : 315 - 325
  • [30] Adaptive temperature control of simulated annealing for solving capacitated vehicle routing problem
    Turky, Ayad M.
    COMPUTER COMMUNICATION AND MANAGEMENT, 2011, 5 : 80 - 82
12345