An ensemble learning based multi-objective evolutionary algorithm for the dynamic vehicle routing problem with time windows

被引:50
作者
Wang, Feng [1 ]
Liao, Fanshu [1 ]
Li, Yixuan [1 ]
Yan, Xuesong [2 ]
Chen, Xu [1 ]
机构
[1] Wuhan Univ, Sch Comp Sci, 299 Bayi Rd Wuchang, Wuhan 430072, Peoples R China
[2] China Univ Geosci Wuhan, Sch Comp Sci, Wuhan 430074, Hubei, Peoples R China
关键词
Dynamic vehicle routing problem; Dynamic multi-objective optimization; Ensemble learning; SEARCH;
D O I
10.1016/j.cie.2021.107131
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The Vehicle Routing Problem (VRP) is a typical combinatorial optimization problem and has been studied for many years. However, there are few researches on the Dynamic Vehicle Routing Problem with Time Window (DVRPTW), which is an extension of VRP and more challenging with changing environmental factors, such as stochastic customer requests. Once changes happen, the routes should be adjusted for the new environments. In this paper, we construct a multi-objective optimization model for the DVRPTW and propose a new algorithm named as EL-DMOEA, where an ensemble learning method is investigated to improve the performance of the algorithm. In EL-DMOEA, to enhance the population's diversity and accelerate the convergence, three different strategies, i.e., population-based prediction strategy, immigrant strategy and random strategy, are employed in the training process of three kinds of basic models respectively. The experimental results on the test benchmarks reveal that the proposed algorithm is effective to make promising routing plans.
引用
收藏
页数:11
相关论文
共 47 条
[1]  
Abbatecola Lorenzo, 2016, 2016 IEEE International Conference on Automation Science and Engineering (CASE), P361, DOI 10.1109/COASE.2016.7743429
[2]  
Barkaoui Mohamed, 2008, American Journal of Mathematical and Management Sciences, V28, P131
[3]   A co-evolutionary approach using information about future requests for dynamic vehicle routing problem with soft time windows [J].
Barkaoui, Mohamed .
MEMETIC COMPUTING, 2018, 10 (03) :307-319
[4]  
Benadada Y., 2017, P 2 INT C BIG DAT CL, P1091
[5]   Scenario-based planning for partially dynamic vehicle routing with stochastic customers [J].
Bent, RW ;
Van Hentenryck, P .
OPERATIONS RESEARCH, 2004, 52 (06) :977-987
[6]  
Bouchra B., 2016, P 3 INT C LOG OP MAN
[7]   Designing robust routes for demand-responsive transport systems [J].
Bruni, M. E. ;
Guerriero, F. ;
Beraldi, P. .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2014, 70 :1-16
[8]   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
[9]  
Elhassania M, 2014, PROCEEDINGS OF 2014 2ND IEEE INTERNATIONAL CONFERENCE ON LOGISTICS AND OPERATIONS MANAGEMENT (GOL 2014), P62, DOI 10.1109/GOL.2014.6887419
[10]   A decision-theoretic generalization of on-line learning and an application to boosting [J].
Freund, Y ;
Schapire, RE .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 55 (01) :119-139