Computer Science ›› 2014, Vol. 41 ›› Issue (12): 220-225.doi: 10.11896/j.issn.1002-137X.2014.12.048

Previous Articles     Next Articles

Hybrid Differential Evolution Algorithm for Vehicle Routing Problem with Time Windows

SONG Xiao-yu,ZHU Jia-yuan and SUN Huan-liang   

  • Online:2018-11-14 Published:2018-11-14

Abstract: Aiming at the vehicle routing problem with time windows,a multi-objective mathematical model was built with goals of minimizing the vehicle number and the travel distance,and it was solved by a hybrid differential evolution algorithm which is based on Pareto-dominance,combined with improved differential evolution algorithm and variable neighborhood descent.First,redefined method to produce new individual was employed.Then,the global exploration and the local exploitation were balanced by combining the dual populations strategy and variable neighborhood descent technology,and the diversity of the population was maintained through the method which uses the random individuals to replace the repetition individuals.Third,Pareto-dominance was applied to compare different solutions,and Arena’s principle was adopted to construct non-dominated solution set.Finally computational results on the 18 Solomon problems with the different sizes show that the solution quality of the proposed algorithm averagely increases 2.04% and 14.95% than artificial bee colony algorithm in the travel distance and the vehicle number,and averagely increases 14.53% than the best known solutions in the vehicle number,verifying the effectiveness of the proposed algorithm.

Key words: Vehicle routing problem with time windows,Multi-objective,Differential evolution algorithm,Dual populations,Variable neighborhood descent

[1] Dantzig G,Ramser J.The truck dispatching problem[J].Mana-gement Science,1959(6):80-91
[2] Jung S,Moon B.R.A Hybrid genetic algorithm for the vehicle routing problem with time windows[C]∥Proceedings of Genetic and Evolutionary Computation.San Francisco,CA,USA,2002:1309-1316
[3] Balseiro S R.An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows[J].Computers and Operations Research,2011,38(6):954-966
[4] 魏明,靳文舟.求解车辆路径问题的离散粒子群算法[J].计算机科学,2010,7(4):187-191
[5] Storn R.Differential evolution design of an IIR-filter [C]∥Proceedings of IEEE Conference Evolutionary Computation (S07803-29023).Nagoya,Japan,1996:268-273
[6] Mei Mi,Xue Hui-feng,Zhong Ming,et al.An improved differential evolution algorithm for TSP problem[C]∥Proceedings of Intelligent Computation Technology and Automation.Washington DC,USA,2010:544-547
[7] Onwubolu G,Davendra D.Scheduling flow shops using differential evolution algorithm[J].European Journal of Operational Research,2006,1(2):674-69
[8] 曹二保,赖明勇,聂凯.带时间窗的车辆路径问题的改进差分进化算法研究[J].系统仿真学报,2009,1(8):2420-2423
[9] 王君.带时间窗车辆路径问题的差分进化混合算法[J].计算机工程与应用,2013,9(2):24-28,66
[10] Babu B V,Jehan M M L.Differential evolution for multi-objective optimization[C]∥Proceedings of the IEEE Congress on Evo-lutionary Computation (CEC 2003).Canberra,Australia,2003:2696-2703
[11] Hansen P,Mladenovic N.Variable neighborhood search:principles and applications[J].European Journal of Operational Research,2001,130(3):449-467
[12] 陈萍,黄厚宽,董兴业.求解卸装一体化的车辆路径问题的混合启发式算法[J].计算机学报,2008,1(4):565-573
[13] 郑金华,蒋浩,邝达,等.用擂台法则构造多目标Pareto最优解集的方法[J].软件学报,2007,8(6):1287-1297
[14] 刘敏.多目标遗传算法在车辆路径优化中的应用研究[D].湘潭:湘潭大学,2006
[15] Deb K,Pratap A,Agarwal S,et al.A fast and elitist multiobjective genetic algorithm:NSGA-II[J].IEEE Transactions on Evolutionary Computation,2002,6(2):182-197
[16] http://web.cba.neu.edu/~msolomon/problems.htm
[17] Nahum O E,Hadas Y,Spiegel U.Multi-objective vehicle routing problem with time windows:a vector evaluated artificial bee colo-ny approach[J].International Journal of Computer and Information Technology,2014,3(1):41-47

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!