A POPMUSIC approach for the Multi-Depot Cumulative Capacitated Vehicle Routing Problem

被引:33
作者
Lalla-Ruiz, Eduardo [1 ]
Voss, Stefan [2 ,3 ]
机构
[1] Univ Twente, Dept Ind Engn & Business Informat Syst, Enschede, Netherlands
[2] Univ Hamburg, Inst Informat Syst, Hamburg, Germany
[3] Pontificia Univ Catolica Valparaiso, Escuela Ingn Ind, Valparaiso, Chile
关键词
Multi-Depot Cumulative Vehicle Routing Problem; POPMUSIC; Matheuristic; Disaster logistics; Customer-oriented applications; NEIGHBORHOOD SEARCH; ALGORITHM; FORMULATIONS;
D O I
10.1007/s11590-018-1376-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The Multi-Depot Cumulative Capacitated Vehicle Routing Problem is a variation of the recently proposed Capacitated Cumulative Vehicle Routing Problem, where several depots can be considered as starting points of routes. Its objective aims at minimizing the sum of arrival times at customers for providing service. Practical considerations imply to address the delivery of customers from multiple depots where the service quality level depends on the customer waiting time and the delivering vehicles may be able to depart from different points. Those scenarios require theoretical models to support the decision-making process as well as for measuring the quality of the solutions provided by approximate approaches. In the present work, we formalize this new problem variant by means of a mathematical formulation and propose a matheuristic approach (POPMUSIC) for solving it.
引用
收藏
页码:671 / 691
页数:21
相关论文
共 26 条
  • [21] Efficient GRASP plus VND and GRASP plus VNS metaheuristics for the traveling repairman problem
    Salehipour, Amir
    Sorensen, Kenneth
    Goos, Peter
    Braysy, Olli
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2011, 9 (02): : 189 - 209
  • [22] A HEURISTIC AND LOWER-BOUND FOR A MULTI-DEPOT ROUTING PROBLEM
    SUMICHRAST, RT
    MARKHAM, IS
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (10) : 1047 - 1056
  • [23] The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search
    Sze, Jeeu Fong
    Salhi, Said
    Wassan, Niaz
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2017, 101 : 162 - 184
  • [24] Taillard E.D, 2017, HDB HEURISTICS, P687, DOI [10.1007/978-3-319-07124-4_31, DOI 10.1007/978-3-319-07124-4_31]
  • [25] Taillard ÉD, 2002, OPERAT RES COMP SCI, V15, P613
  • [26] Ambulance routing for disaster response with patient groups
    Talarico, Luca
    Meisel, Frank
    Sorensen, Kenneth
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 56 : 120 - 133