A hybrid multi-objective evolutionary optimization approach for the robust vehicle routing problem

被引:27
作者
Bederina, Hiba [1 ]
Hifi, Mhand [1 ]
机构
[1] Univ Picardie Jules Verne, EPROAD EA 4669, CURI, 7 Rue Moulin Neuf, F-80000 Amiens, France
关键词
Evolutionary; Optimization; Robustness; Vehicle routinga; GENETIC ALGORITHM; TIME WINDOWS; TRUCK;
D O I
10.1016/j.asoc.2018.07.014
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose to approximately solve the robust vehicle routing problem with a population based method. Uncertainty can be modeled by a set of scenarios where each scenario may represent the travel costs assigned to all visited arcs of the graph associated to the problem. Unlike several existing methods that often aggregate multiple objectives into a compromise function, the goal of the proposed approach is to simultaneously optimize both the number of vehicles to use and the worst total travel cost needed. The proposed method can be viewed as a new version of an evolutionary approach which is reinforced with a "strong-diversification". Such a strategy is based upon destroying and re-building procedures that are hybridized with a local search using a series of move operators. A number of experiments have been conducted to assess the performance of the proposed approach. Its achieved results have been tested on benchmark instances extracted from the literature and compared to those reached by the-state-of-the-art GLPK solver and one of the most recent method available in the literature. The proposed method remains competitive, where encouraging results have been obtained. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:980 / 993
页数:14
相关论文
共 26 条
[1]   Min-max and min-max regret versions of combinatorial optimization problems: A survey [J].
Aissi, Hassene ;
Bazgan, Cristina ;
Vanderpooten, Daniel .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) :427-438
[2]  
[Anonymous], INT J COMPUT SCI INF
[3]   A genetic algorithm for the vehicle routing problem [J].
Baker, BM ;
Ayechew, MA .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (05) :787-800
[4]   A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows [J].
Banos, Raul ;
Ortega, Julio ;
Gil, Consolacion ;
Marquez, Antonio L. ;
de Toro, Francisco .
COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 65 (02) :286-296
[5]  
Bederina H., 2016, 2016 4 INT C CONTR E, P1
[6]  
Cheong CY, 2006, IEEE C EVOL COMPUTAT, P1355
[7]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[8]   THE TRUCK DISPATCHING PROBLEM [J].
DANTZIG, GB ;
RAMSER, JH .
MANAGEMENT SCIENCE, 1959, 6 (01) :80-91
[9]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[10]   An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows [J].
Garcia-Najera, Abel ;
Bullinaria, John A. .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (01) :287-300