Computer Science ›› 2014, Vol. 41 ›› Issue (Z11): 35-38.

Previous Articles     Next Articles

Vehicle Routing Problem with Time Window and its Application Based on Rich Road Network Weights

ZHANG Bei-jin,ZHOU Xiao-gen,MING Jie,YAO Chun-long and ZHANG Gui-jun   

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

Abstract: To solve vehicle routing problem with indeterminate number of vehicles,large-scale outlets and multi-level transportation network,we established the road property mode based on rich network and GIS,mixed N-order nearest-neighbor adaptive clustering algorithm and genetic algorithm.Firstly,to solve the problem of small-scale outlets(less than 20 outlets) in traditional vehicle routing problem and the defect that abstracting the outlets into graph’s vertices during model establishing,we established network dataset based on actual road data,utilized GIS to exactly calculate the distance between outlets and built OD matrix of distance.Secondly,to reduce the complexity of designing large-scale outlets optimization algorithm,this paper used N-order nearest-neighbor adaptive clustering algorithm to determine the number of clusters,then divided the distribution outlets by clusters.Subsequently,to determine the kind and number of distribution vehicles and restriction of time window,we used genetic algorithm to optimize the distribution path.Finally,two examples verified the effectiveness of the proposed method.

Key words: Rich network model,Clustering algorithm,Genetic algorithm,OD matrix,Vehicle routing

[1] 杨弋,顾幸生.物流配送车辆优化调度的综述[J].东南大学学报:自然科学版,2003 (z1):105-111
[2] Lenstra J K,Kan A H G.Complexity of vehicle routing and scheduling problems[J].Networks,1981,11(2):221-227
[3] Solomon M M,Desrosiers J.Survey Paper-Time Window Constrained Routing and Scheduling Problems[J].Transportation science,1988,22(1):1-13
[4] Thangiah S R,Nygard K E,Juell P L.Gideon:A genetic algorithm system for vehicle routing with time windows[C]∥Se-venth IEEE Conference on Artificial Intelligence Applications,1991.IEEE,1991,1:322-328
[5] Blanton Jr J L,Wainwright R L.Multiple vehicle routing with time and capacity constraints using genetic algorithms[C]∥Proceedings of the 5th International Conference on Genetic Algorithms.Morgan Kaufmann Publishers Inc.,1993:452-459
[6] Hwang H S.An improved model for vehicle routing problemwith time constraint based on genetic algorithm[J].Computers & Industrial Engineering,2002,42(2):361-369
[7] Timucin Ozdemir H,Mohan C K.Evolving schedule graphs for the vehicle routing problem with time windows[C]∥Procee-dings of the 2000 Congress on Evolutionary Computation,2000.IEEE,2000,2:888-895
[8] Tan K C,Lee T H,Ou K,et al.A messy genetic algorithm for the vehicle routing problem with time window constraints[C]∥Proceedings of the 2001 Congress on Evolutionary Computation,2001.IEEE,2001,1:679-686
[9] Baker B M,Ayechew M A.A genetic algorithm for the vehicle routing problem[J].Computers & Operations Research,2003,30(5):787-800
[10] 戚铭尧,张金金,任丽.基于时空聚类的带时间窗车辆路径规划算法[J].计算机科学,2014,41(3):218-222
[11] Chen A Y,Pea-Mora F,Ouyang Y.A collaborative GIS framework to support equipment distribution for civil engineering disaster response operations[J].Automation in Construction,2011,20(5):637-648
[12] Zsigraiova Z,Semiao V,Beijoco F.Operation costs and pollutant emissions reduction by definition of new collection scheduling and optimization of MSW collection routes using GIS.The case study of Barreiro,Portugal[J].Waste management,2013,33(4):793-806
[13] 张贵军,吴惕华.GIS 线形矢量图形最优路径算法研究及仿真实现[J].系统仿真学报,2003,15(4):551-553
[14] 洪榛,张贵军,俞立.基于 N 阶近邻分析的自适应差分进化算法[J].控制理论与应用,2012,28(11):1613-1620

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!