A unified model framework for the multi-attribute consistent periodic vehicle routing problem

被引:4
作者
Baldoquin, Maria Gulnara [1 ]
Martinez, Jairo A. [1 ]
Diaz-Ramirez, Jenny [2 ]
机构
[1] Univ EAFIT, Dept Math Sci, Medellin, Antioquia, Colombia
[2] Univ Monterrey, Engn Dept, Monterrey, NL, Mexico
关键词
TIME WINDOWS; ALGORITHM;
D O I
10.1371/journal.pone.0237014
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Modeling real-life transportation problems usually require the simultaneous incorporation of different variants of the classical vehicle routing problem (VRP). The periodic VRP (PVRP) is a classical extension in which routes are determined for a planning period of several days and each customer has an associated set of allowable visit schedules. This work proposes a unified model framework for PVRP that consists of multiple attributes or variants not previously addressed simultaneously, such as time-windows, time-dependence, and consistency -which guarantees the visits to customer by the same vehicle-, together with three objective functions that respond to the needs of practical problems. The numerical experimentation is focused on the effects of three factors: frequency, depot centrality, and the objective function on the performance of a general-purpose MILP solver, through the analysis of the achieved relative gaps. Results show higher sensitivity to the objective functions and to the problem sizes.
引用
收藏
页数:27
相关论文
共 62 条
[1]   A survey of recent advances in vehicle routing problems [J].
Adewumi A.O. ;
Adeleke O.J. .
International Journal of System Assurance Engineering and Management, 2018, 9 (01) :155-172
[2]  
AHN BH, 1991, J OPER RES SOC, V42, P393, DOI 10.1038/sj/jors/0420506
[3]  
[Anonymous], 2000, VRP TIME WINDOWS
[4]   The Flexible Periodic Vehicle Routing Problem [J].
Archetti, Claudia ;
Fernandez, Elena ;
Huerta-Munoz, Diana L. .
COMPUTERS & OPERATIONS RESEARCH, 2017, 85 :58-70
[5]   A Model and Solution Method for Solving the Real-world and Complex Problem of Scheduling Visits to Customers [J].
Baldoquin de la Pena, M. G. ;
Escalera Farinas, A. ;
Linfati, R. .
JOURNAL OF APPLIED RESEARCH AND TECHNOLOGY, 2014, 12 (03) :333-342
[6]  
Beltrami E.J., 1974, NETWORKS, V4, P65, DOI [10.1002/net.3230040106, DOI 10.1002/NET.3230040106]
[7]   The vehicle routing problem: State of the art classification and review [J].
Braekers, Kris ;
Ramaekers, Katrien ;
Van Nieuwenhuyse, Inneke .
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 :300-313
[8]   Multi-depot periodic vehicle routing problem with due dates and time windows [J].
Cantu-Funes, Roberto ;
Salazar-Aguilar, M. Angelica ;
Boyer, Vincent .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2018, 69 (02) :296-306
[9]   AN IMPROVED HEURISTIC FOR THE PERIOD VEHICLE-ROUTING PROBLEM [J].
CHAO, IM ;
GOLDEN, BL ;
WASIL, E .
NETWORKS, 1995, 26 (01) :25-44
[10]   THE PERIOD ROUTING PROBLEM [J].
CHRISTOFIDES, N ;
BEASLEY, JE .
NETWORKS, 1984, 14 (02) :237-256