A TWO-PHASE METHOD WITH IDBSCAN AND ACO FOR LOGISTICS DISTRIBUTION
The difficulties in logistics distribution lie in the determination of distribution routes.That can be reduced to VRP (Vehicle Routing Problems),which was raised and focused by scholars in 1950s and lots of methods have been applied to.One of the effective solutions is to divide VRP into independent TSP (Traveling Salesman Problems) and then solve them separately,which is a typical two-phase method.In the first phase,the division of VRP will be realized by IDBSCAN (Improved Density-Based Spatial Clustering of Application with Noise),which is extended from DBSCAN (Density-Based Spatial Clustering of Applications with Noise).In the second stage,all TSP in clusters will be solved by Ant Colony Optimization (ACO) algorithm and the solution set is the ultimate distribution routes,then experiment in the data set which is a quarter of sales data from E-commerce site company.For better simulation,the distance between two customer sites in the sales data will be measured by practical driving distance.This improved algorithm is experimentally turned out to be effective and competitive.
Clustering analysis Ant colony optimization (ACO) Vehicle routing problems (VRP)
Hongfeng Zhang Yan Yang Hongjun Wang Fei Teng
School of Information Science & Technology,Provincial Key Lab of Cloud Computing and Intelligent Technology,Southwest Jiaotong University,Chengdu 610031,China
国际会议
杭州
英文
190-195
2012-10-30（万方平台首次上网日期，不代表论文的发表时间）