An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

被引：97
|
作者：
Laporte, Gilbert [1 ]
Musmanno, Roberto [2 ]
Vocaturo, Francesca [3 ]
机构：
[1] HEC Montreal, Montreal, PQ H3T 2A7, Canada
[2] Univ Calabria, Dipartimento Elettr Informat & Sistemist, I-87036 Arcavacata Di Rende, CS, Italy
[3] Univ Calabria, Dipartimento Econ & Stat, I-87036 Arcavacata Di Rende, CS, Italy
来源：
TRANSPORTATION SCIENCE | 2010年 / 44卷 / 01期
基金：
加拿大自然科学与工程研究理事会;
关键词：
capacitated arc-routing problem; stochastic programming with recourse; a priori optimization; adaptive large neighbourhood search; TO-RECORD TRAVEL; INTERMEDIATE FACILITIES; LOWER BOUNDS; ALGORITHM; OPTIMIZATION;
D O I：
10.1287/trsc.1090.0290
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The capacitated arc-routing problem with stochastic demands (CARPSD) is an extension of the well-known capacitated arc-routing problem (CARP) in which demands are stochastic. This leads to the possibility of route failures whenever the realized demand exceeds the vehicle capacity. This paper presents the CARPSD in the context of garbage collection. It describes an adaptive large-scale neighbourhood search heuristic for the problem. Computational results show the superiority of this algorithm over an alternative solution approach.
引用
收藏
页码：125 / 135
页数：11
相关论文
共 50 条
  • [1] A tabu search heuristic for the capacitated arc routing problem
    Hertz, A
    Laporte, G
    Mittaz, M
    [J]. OPERATIONS RESEARCH, 2000, 48 (01) : 129 - 135
  • [2] A hybrid adaptive large neighbourhood search algorithm for the capacitated location routing problem
    Akpunar, Ozge Satir
    Akpinar, Sener
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2021, 168
  • [3] An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
    Ribeiro, Glaydston Mattos
    Laporte, Gilbert
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 728 - 735
  • [4] Periodic capacitated arc-routing problem with inventory constraints
    Riquelme-Rodriguez, Juan-Pablo
    Gamache, Michel
    Langevin, Andre
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2014, 65 (12) : 1840 - 1852
  • [5] A guided local search heuristic for the capacitated arc routing problem
    Beullens, P
    Muyldermans, L
    Cattrysse, D
    Van Oudheusden, D
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 147 (03) : 629 - 643
  • [6] Adaptive Large Neighborhood Search for the Periodic Capacitated Arc Routing Problem with Inventory Constraints
    Riquelme-Rodriguez, Juan-Pablo
    Langevin, Andre
    Gamache, Michel
    [J]. NETWORKS, 2014, 64 (02) : 125 - 139
  • [7] Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem
    Akpinar, Sener
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2016, 61 : 28 - 38
  • [8] Capacitated arc routing problem with deadheading demands
    Kirlik, Gokhan
    Sipahioglu, Aydin
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (10) : 2380 - 2394
  • [9] Forest-based Tabu Search to the Split-delivery Capacitated Arc-routing Problem
    Lai, Qidong
    Zhang, Zizhen
    Jin, Xin
    Qin, Hu
    [J]. 2018 IEEE 14TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2018, : 1237 - 1242
  • [10] An improved heuristic for the capacitated arc routing problem
    Santos, Luis
    Coutinho-Rodrigues, Joao
    Current, John R.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (09) : 2632 - 2637
12345