Optimisation of Urban Logistics Distribution Routing with Time Window

Hongyu Li

doi:10.54097/jcfp8v73

Authors

Hongyu Li

DOI:

https://doi.org/10.54097/jcfp8v73

Keywords:

Time Window; Mileage Saving Method; Urban Logistics; Distribution Center; Path Optimization.

Abstract

Reasonable optimization of the path can not only reduce unnecessary logistics cost expenditure; efficient circulation speed can also enhance the economic development of the city. In the process of the transformation of the model, it will be directly affected by the change of the importance of logistics enterprises to logistics distribution work. Based on the background of urban logistics, the optimization process of multi-logistics distribution path with time window is comprehensively studied. The relevant theoretical knowledge involved in the distribution link is reviewed, and through the analysis of the existing problems of urban logistics and the vehicle path optimization problem, the heuristic algorithm is used to establish the path optimization model of urban logistics center with time window, which reduces the vehicle transportation cost, thus reducing the total cost of logistics, and at the same time, improves the efficiency of the internal circulation of urban logistics and accelerates the economic development.

Downloads

Download data is not yet available.

References

[1] Lucas R. On the Mechanics of Economic Development [J] Journal of Monetary Economics,1988(22):3-42.

[2] Perroux F. Economic Space: Theory and Applications[J]. Quarterly Joual of Economics,1950 64(01):89-104.

[3] Qin Lu. Research on Spatial Structure Characteristics and Evolution Theory of Urban Logistics [D]. Beijing: Beijing Jiaotong University, 2012.

[4] Hu Han, Meng yuan. Analysis of Logistics Operation in 2020 [R]. China: China Federation of Logistics and Purchasing, 2020.

[5] Paolo Toth, Daniele Vigo. THE VEHICLE ROUTING PROBLEM[M]. Society for Industrial and Applied Mathematics philadephia.2002.

[6] Clarke G, Wright J W. Scheduling of vehicle les from a central depot to a number of delivery points[J]. Operations research, 1964, 12(4): 568-581.

[7] Taillard E. Parallel interative search method for vehicle routing problem [J].Operations Research Society,1 994, 45(10): 115-116.

[8] Desrosiers J, Solomon M. A new optimization algorithm for the vehicle routing problem with time windows[J]. Operations research,1992,40(2): 342-354.

[9] CESCHIA S, GASPERO L D, SCHAERF A. Tabu Search Techniques for the Heterogeneous Vehicle Routing Problem with Time Windows and Carrier-Dependent Costs[J]. Journal of Scheduling,2011,14(6):601-615.

[10] Teo Taniguchi.Evaluation of Urban Distribution Center Using Multiagent Model with Geographic Information Systems[A]. Transportation Research Board 94th Annual Meeting[C].2015.

[11] Wu Jieming. Simulation Research on Vehicle Routing Problem in Logistics Distribution [J]. Computer Simulation, 2011, (7): 25-27.

[12] Hao Ruiqing, Yan Li. Research on Vehicle Routing Problem of Military Distribution Logistics [J]. Journal of Xi'an University of Technology, 2015. (1): 5-7.

[13] Ge Xianlong, Xu Maozeng, Wang Weixin. Research on Quantum Genetic Algorithm for Multi-type Vehicle Routing Problem [J]. China Management, 2013 (1): 125-133.

[14] Tai Xiaohong, Li Lu. Optimization of Logistics Distribution Path Based on Improved Saving Method [J]. Journal of Liaoning Technical University (Natural Science Edition), 2016,35 (6): 667-672.

[15] Qu Qianqian, Qu Shiru, Wen Kaige. Hybrid Genetic Algorithm for Solving Distribution Vehicle Scheduling Problem [J]. Computer Engineering and Application, 2008,44 (15): 205-207.

[16] He Zhenggang, Liu Sha. Study on Path Optimization of Urban Medical Waste Recycling-Taking Jinniu District of Chengdu as an Example [J]. Logistics Technology, 2015, (1): 34-37.