Model and algorithm of vehicle routing problem under dynamic traffic

He Zhu-qing; Sun Lin-yan

Volume 7 Issue 1

Turn off MathJax

Article Contents

Article Navigation > Journal of Traffic and Transportation Engineering > 2007 > 7(1): 111-115

Next Previous

He Zhu-qing, Sun Lin-yan. Model and algorithm of vehicle routing problem under dynamic traffic[J]. Journal of Traffic and Transportation Engineering, 2007, 7(1): 111-115.

Citation:

He Zhu-qing, Sun Lin-yan. Model and algorithm of vehicle routing problem under dynamic traffic[J]. Journal of Traffic and Transportation Engineering, 2007, 7(1): 111-115.

He Zhu-qing, Sun Lin-yan. Model and algorithm of vehicle routing problem under dynamic traffic[J]. Journal of Traffic and Transportation Engineering, 2007, 7(1): 111-115.

Citation:

He Zhu-qing, Sun Lin-yan. Model and algorithm of vehicle routing problem under dynamic traffic[J]. Journal of Traffic and Transportation Engineering, 2007, 7(1): 111-115.

PDF( 383 KB)

Model and algorithm of vehicle routing problem under dynamic traffic

School of Management, Xi'an Jiaotong University, Xi'an 710049, Shaanxi, China

More Information

Author Bio:
He Zhu-qing(1976-), male, doctoral student, +86-29-82674838, hzq@mail.xjtu.edu.cn

Sun Lin-yan(1955-), male, professor, +86-29-82668748, lysun@mail.xjtu.edu.cn
Received Date: 2006-09-20
Publish Date: 2007-02-25

Abstract

Abstract

In order to optimize logistics delivery cost and consumer service level under dynamic traffic, transportation time was assorted into different distributions according to traffic, a mixed integer non-linear model of vehicle routing choice with time window constraints was set up to minimize logistics cost, a genetic algorithm with natural number coding was designed to solve the model, the simulation results of different delivery projects were compared. Comparison result shows that the algorithm is convergent, the logistics cost is reduced by 2%, the service level is improved by 5% to vehicle routing choice according to traffic condition.
- traffic planning,
- dynamic traffic,
- vehicle routing problem,
- time window,
- genetic algorithm

FullText(HTML)

References(16)

References

[1]	Charnes A, Cooper W. The truck dispatching problem[J]. Management Science, 1959, 6(1): 80-91. doi: 10.1287/mnsc.6.1.80
[2]	Gillett B, Miller L. Aheuristic algorithm for the vehicle dispatch problem[J]. Operations Research, 1974, 22(2): 340-349. doi: 10.1287/opre.22.2.340
[3]	Gilbert L. The vehicle routing problem: an overviewof exact approxi mate algorithms[J]. European Journal of Operational Research, 1992, 59(3): 345-358. doi: 10.1016/0377-2217(92)90192-C
[4]	Michel G, Gilbert L, Rene S. Invited review: stochastic vehicle routing[J]. European Journal of Operational Research, 1996, 88(1): 3-12. doi: 10.1016/0377-2217(95)00050-X
[5]	Eiichi T. An evaluation methodology for city logistics[J]. Transport Reviews, 2000, 20(1): 65-90. doi: 10.1080/014416400295347
[6]	Yang Rui-chen, Zhou Yong-fu, Yun Qing-xia. Hybrid algorithm of vehicle's optimal route[J]. Journal of Traffic and Transportation Engineering, 2005, 5(1): 102-105. (in Chinese) doi: 10.3321/j.issn:1671-1637.2005.01.024
[7]	Niu Yong-liang, Wang Jin-mei. Vehicle route algorithm of logistics distribution[J]. Journal of Traffic and Transportation Engineering, 2006, 6(2): 83-87. (in Chinese) doi: 10.3321/j.issn:1671-1637.2006.02.019
[8]	Hu Da-wei, Zhu Zhi-qiang, Hu Yong. Si mulated annealing algorithm for vehicle routing problem[J]. China Journal of Highway and Transport, 2006, 19(4): 123-126. (in Chi-nese). doi: 10.3321/j.issn:1001-7372.2006.04.023
[9]	Chen Song-yan, I mai Akio. Model and heuristic solution for location routing problems of logistics network[J]. Journal of Traffic and Transportation Engineering, 2006, 6(3): 118-121. (in Chinese) doi: 10.3321/j.issn:1671-1637.2006.03.025
[10]	Orda A, Rom R. Shortestpath and mini mumdelay algorithms in networks with time-dependent edgelength[J]. Journal of the ACM, 1990, 37(3): 607-625. doi: 10.1145/79147.214078
[11]	Halpern J. The shortest-route withtimedependent length of edges and li mited delay possibilities in nodes[J]. Mathematical Methods of Operations Research, 1977, 21(10): 117-124.
[12]	Hill A, Benton W. Modelling intra-city time-dependent travel speeds for vehicle's cheduling problems[J]. Journal of the Operations Research Society, 1992, 43(4): 343-351. doi: 10.1057/jors.1992.49
[13]	Soumia I, Michel G, Jean Y. Vehicle dispatching with time-dependent travel times[J]. European Journal of Operational Research, 2003, 144(2): 379-396. doi: 10.1016/S0377-2217(02)00147-9
[14]	Xu Tong-lian, Luan Kun, Jia Hong-fei. Consolidation strategy and distribution cost of joint distribution[J]. Journal of Chang an University: Natural Science Edition, 2006, 26(3): 68-71. (in Chinese) doi: 10.3321/j.issn:1671-8879.2006.03.017
[15]	Jian Gui-yan, Gang Long-hui, Wang Jiang-feng. Traffic congestion identification method of urban expressway[J]. Journal of Traffic and Transportation Engineering, 2006, 6(3): 88-91. (in Chinese) http://transport.chd.edu.cn/article/id/200603019
[16]	Xiong Lie-qiang, Wang Fu, Li Jie. Dynamical model of traffic flow on segment and its simulation[J]. China Journal of Highway and Transport, 2006, 19(2): 92-94. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200602015.htm