Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows

被引：1
作者：
Cassettari, Lucia [1 ]
Gaggero, Mauro [2 ]
Saccaro, Stefano [1 ]
机构：
[1] Univ Genoa, Dept Mech Engn, Genoa, Italy
[2] Natl Res Council Italy, Inst Marine Engn, I-16149 Genoa, Italy
来源：
NETWORKS | 2021年 / 78卷 / 03期
关键词：
gas metering service optimization; heuristics; mixed‐ integer programming; multiple objectives; vehicle routing problem with time windows; PARTICLE SWARM OPTIMIZATION; EVOLUTIONARY ALGORITHM; HEURISTICS; NETWORK; DEMAND;
D O I：
10.1002/net.22044
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Optimization of maintenance services of a company working in the gas metering sector is investigated. In particular, daily tasks of operators are optimized by exploiting the paradigm of vehicle routing problems with a set of predefined time windows that overlap one with the others and four competing objectives to take into account. First, an exact integer formulation is presented that can be solved only for a reduced number of customer sites to visit. Then, a heuristic approach is proposed to find approximate solutions with huge savings on the computational effort, also for high-dimensional instances. Numerical results on both real and synthetic scenarios showcase the effectiveness of the approach.
引用
收藏
页码：284 / 302
页数：19
相关论文
共 51 条
[1]   Multi-objective design optimization of natural gas transmission networks [J].
Alves, Felipe da Silva ;
Miranda de Souza, Jame Neiva ;
Hemerly Costa, Andre Luiz .
COMPUTERS & CHEMICAL ENGINEERING, 2016, 93 :212-220
[2]   An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles [J].
Azi, Nabila ;
Gendreau, Michel ;
Potvin, Jean-Yves .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) :756-763
[3]   Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints [J].
Baldacci, Roberto ;
Mingozzi, Aristide ;
Roberti, Roberto .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 218 (01) :1-6
[4]   An Exact Algorithm for the Pickup and Delivery Problem with Time Windows [J].
Baldacci, Roberto ;
Bartolini, Enrico ;
Mingozzi, Aristide .
OPERATIONS RESEARCH, 2011, 59 (02) :414-426
[5]   Stochastic vehicle routing problem with heterogeneous vehicles and multiple prioritized time windows: Mathematical modeling and solution approach [J].
Baradaran, Vahid ;
Shafaei, Amir ;
Hosseinian, Amir Hossein .
COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 131 :187-199
[6]   Dynamic optimization of natural gas networks under customer demand uncertainties [J].
Behrooz, Hesam Ahmadian ;
Boozarjomehry, R. Bozorgmehry .
ENERGY, 2017, 134 :968-983
[7]   Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows [J].
Belhaiza, Slim ;
M'Hallah, Rym ;
Ben Brahim, Ghassen ;
Laporte, Gilbert .
JOURNAL OF HEURISTICS, 2019, 25 (03) :485-515
[8]   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
[9]   On the effectiveness of set covering formulations for the vehicle routing problem with time windows [J].
Bramel, J ;
SimchiLevi, D .
OPERATIONS RESEARCH, 1997, 45 (02) :295-301
[10]   Vehicle routing problem with time windows, part 1:: Route construction and local search algorithms [J].
Bräysy, I ;
Gendreau, M .
TRANSPORTATION SCIENCE, 2005, 39 (01) :104-118
123456