International College, Beijing Wuzi University, Beijing, China. Graduate College, Beijing Wuzi University, Beijing, China.
This paper presents an optimization problem about terminal distribution network path, defining the research problem through its distribution operation process, next to the terminal distribution route optimization. To begin with, dynamic optimization algorithm is built, the first from the target distribution node distribution vehicle, and goods to N customers are delivered, in the most appropriate distribution route to the minimum distribution distance and optimizing the terminal distribution path. Two parts to build and example areincluding algorithm.
Zhang, X. and Zhang, X. (2014) The Research of Terminal Distribution Network Path Optimization. Journal of Computer and Communications, 2, 28-37. doi: 10.4236/jcc.2014.25002.
[1] Niu, Y.L. and Wang, J.M. (2006) Logistics Distribution Vehicle Route Algorithm. Journal of Transportation Engineering, 6, 83-87.
[2] Wang, R.M., Wang, S.M. and Wang, Z.J. (2007) Directional Simulated Annealing Algorithm Is a Kind of Vehicle Routing Problem. Manufacturing Technology Research, 1, 16-19.
[3] Jiang, Z.Z. and Wang, D.W. (2006) And Fuzzy Planning Model of Logistics Distribution Vehicle Routing Optimization Algorithm. Journal of System Simulation, 17, 3301-3304.
[4] Liu, Q.S., Wen, X.J. and Pan, X.X. (2009) Home Appliances to the Countryside in the Logistics Distribution System Optimization of Vehicle Loading Study. Commercial Modernization, 575, 119-120.
[5] Hyun, J.K. and Gerald, W.E. (2007) A Genetic Algorithm-Based Heuristic for the Dynamic Integrated forward/ Reverse Logistics Network for 3PLs. Computers & Operations Research, 34, 346-366. http://dx.doi.org/10.1016/j.cor.2005.03.004
[6] Ma, Z.J. (2005) Generation of Clever. Products Recycling Reverse Logistics Network Optimization Design Model. Journal of Management Engineering, 12, 114-117.
[7] Eiselt, H.A., Michel, G. and Gilbert, L. (1995) Arc Routing Problems, Part I: The Chinese Postman Problem. Operations Research, 43, 231-242. http://dx.doi.org/10.1287/opre.43.2.231
[8] Groves, G., le Roux, J. and van Vuuren, J.H. (2004) Network Service Scheduling and Routing. International Transactions in Operational, 11, 613-643.
[9] Pharn, W.L. and Chiu, W.C. (2005) Approximate Solutions for the Maximum Benefit Chinese Postman Problem. International Journal of Systems Science, 36, 815-822. http://dx.doi.org/10.1080/0020 7720500282292
[10] Qin, W.Q. (2006) Horizontal Cooperation Supply Chain and Distribution Network Research. Guangxi University.
[11] Mou, L.M. and Dai, X.D. (2013) Effective in Solving Selective Single Commodity Distribution Collection of Ant Colony Algorithm. Journal of Computer Applications and Software, 30, 93-96.
[12] Zhou, Y.C. and Sun, X.C. (2012) Logistics Distribution Path Optimization Research Based on Improved Genetic Algorithm. Computer Engineering and Science, 10, 118-122.
[13] Long, H. and Wu, Y. (2012) Time-Varying under the Condition of City Logistics Distribution Vehicle Routing Optimization. Journal of Automobile Industry of Hubei Province College, 2, 42-45.
[14] Wang, N.L. (2012) The Automobile Assembly Line Material Distribution with Time Windows Path Planning. Journal of Industrial Engineering, 15, 94-99.
[15] Xu, L.R. (2013) Based on LINGO of City Logistics Distribution Path Optimization. Journal of Electronic Design Engineering, 276, 52-54.