Achieving robustness in the capacitated vehicle routing problem with stochastic demands

被引:7
作者
Bernardo, Marcella [1 ]
Du, Bo [1 ,2 ]
Matias, Amanda Bezerra [3 ]
机构
[1] Univ Wollongong, SMART Infrastruct Facil, Wollongong, NSW 2522, Australia
[2] Univ Wollongong, Sch Civil Min & Environm Engn, Wollongong, NSW, Australia
[3] Inst Fed Educ Ciencia & Tecnol Piaui, Inst Fed Piaui, Teresina, Brazil
来源
TRANSPORTATION LETTERS-THE INTERNATIONAL JOURNAL OF TRANSPORTATION RESEARCH | 2023年 / 15卷 / 03期
关键词
Vehicle routing problem; stochastic demand; robustness; mean-variance model; stochastic programming; selective waste collection; kerbside recycling collection; OPTIMIZATION; ALGORITHM; COLLECTION; DELIVERY; DEPOT;
D O I
10.1080/19427867.2022.2049547
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Stochastic demands can impact the quality and feasibility of a solution. Robust solutions then become paramount. One way to achieve robustness in the Capacitated Vehicle Routing Problem with Stochastic Demands (CVRPSD) is to add a measure of the second-stage (recourse) distance to the objective function of the deterministic problem. We adopt variance as a measure of the recourse distance and propose a Mean-Variance (MV) model. To solve the model, a Hybrid Sampling-based solution approach is developed. Numerical experiments are conducted on benchmark instances and a selective waste collection system in Brazil. We compare our model with others from literature which also use a measure of the second-stage distance to attain robustness. The numerical results show that our model generates the most robust solutions. The comparison provides detailed features of each model and their advantages and disadvantages, helping decision-makers decide which model to utilize based on their different needs and priorities.
引用
收藏
页码:254 / 268
页数:15
相关论文
共 52 条
[1]   The close-open mixed multi depot vehicle routing problem considering internal and external fleet of vehicles [J].
Azadeh, A. ;
Farrokhi-Asl, H. .
TRANSPORTATION LETTERS-THE INTERNATIONAL JOURNAL OF TRANSPORTATION RESEARCH, 2019, 11 (02) :78-92
[2]  
Barrico C, 2006, IEEE C EVOL COMPUTAT, P1872
[3]   Adjustable robust solutions of uncertain linear programs [J].
Ben-Tal, A ;
Goryashko, A ;
Guslitzer, E ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2004, 99 (02) :351-376
[4]   A simulation-based solution approach for the robust capacitated vehicle routing problem with uncertain demands [J].
Bernardo, Marcella ;
Du, Bo ;
Pannek, Juergen .
TRANSPORTATION LETTERS-THE INTERNATIONAL JOURNAL OF TRANSPORTATION RESEARCH, 2021, 13 (09) :664-673
[5]   Robust Solution Approach for the Dynamic and Stochastic Vehicle Routing Problem [J].
Bernardo, Marcella ;
Pannek, Juergen .
JOURNAL OF ADVANCED TRANSPORTATION, 2018,
[6]   The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53
[7]  
Birge JR, 2011, SPRINGER SER OPER RE, P3, DOI 10.1007/978-1-4614-0237-4
[8]   Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands [J].
Calvet, Laura ;
Wang, Dandan ;
Juan, Angel ;
Bove, Lluc .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (02) :458-484
[9]   Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study [J].
Carlos Molina, Jose ;
Eguia, Ignacio ;
Racero, Jesus .
TOP, 2019, 27 (02) :253-287
[10]  
Christofides N., 1979, Combinatorial optimization, P315