The Study of Logistics Distribution Routing Optimization Problem Based on B2C E-Commerce

Abstract:

This essay aims at the intelligence of logistics and distribution and uses the ideas of the systematic engineering to analyze the vehicle route optimization problem based on the characteristics of B2C e-commerce and has already established path optimization model of constraint three-dimensional distribution. According to the nearest distribution method it has transferred the multiple distribution centers VRP problem into a single distribution center problem and has designed the method of tabooing search for the initial algorithm. Ultimately it made the exchange generated method in the neighborhood search algorithm come true, and used examples to demonstrate the effectiveness of this kind of algorithm.

• Periodical: Advanced Materials Research (Volumes 765-767)
• Pages: 1173-1176
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.765-767.1173
• Online since: September 2013
• Authors: Xiu Xia Yu, Ying Hong Dong, Li Yue
• Keywords: B2C E-Commerce, Method of Tabooing Search, Three-Dimensional Constraint Model

References

[1] Laporte G , Mercure H ., Nobery Y. An exact algorithm for the asymmetrical capacitated vehicle routing problem J. N etworks, 1986, (1 6): 33-46.

DOI: 10.1002/net.3230160104

[2] Christofides N., Vehicle Routing in The Traveling Salesman Problem: A Guide Tour of Combinatorial Optimization M. Wiley. Chichester, (1985).

[3] Cheng R. Gen M. Fuzzy Vehicle Routing and Scheduling Problem Using Genetic Algorithms A. Genetic Algorithms and Soft Computing Springer, Berlin , 1996, 68 3-709.

[4] Xian QianTing. Modern logistics management. Southeast university press. (2003).

[5] Shiming, Xiang, Visual C++ Digital Image and Graphic Processing, Beijing: Electronics Industry Publication, 2002, pp.12-32.

[6] (USA)Joel Siegel Jae Shim. MaiHua Yin Translation. A Database Management System. Beijing: Tsinghua university press, (2003).