标题:The TSP Solution for the Supermarket Chains Supply Route Based on 'Ant Colony - Particle Swarm' Algorithm
作者:Lin, Chengcao ;Wu, Yaohua ;Lin, Yuhong
作者机构:[Lin, Chengcao ;Wu, Yaohua ] Shandong University, School of Control Science and Engineering, Jinan, Shandong; 250061, China;[Lin, Yuhong ] Fujian Agri 更多
会议名称:37th Chinese Control Conference, CCC 2018
会议日期:25 July 2018 through 27 July 2018
来源:Chinese Control Conference, CCC
出版年:2018
卷:2018-January
页码:3133-3138
DOI:10.23919/ChiCC.2018.8484208
关键词:Ant Colony algorithm; intelligent algorithm; supermarket chain; Traveling Salesman Problem
摘要:The empty loading rate is high in the one-to-one line of distribution, which causes an empty return phenomenon, resulting in higher distribution costs. To reduce the costs of supply logistics in same city, the TSP solution is employed to optimize the problem to make the effect that one route serves numerous demand points. Taking the supply route of a supermarket in Jinan City as an example, the Simulated Annealing, Genetic algorithm and Ant Colony algorithm are utilized to calculate the optimal routes at 10 times. The advantages and the disadvantages of each algorithm for this case are compared. Based on the above, a joint algorithm 'Ant Colony-Particle Swarm' algorithm is designed. Through the solution of the supply route in supermarket chains in same city, the joint algorithm 'Ant Colony - Particle Swarm' algorithm proved to be having a high convergence speed and good practical value for the TSP problem. © 2018 Technical Committee on Control Theory, Chinese Association of Automation.
收录类别:EI;SCOPUS
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85062701080&doi=10.23919%2fChiCC.2018.8484208&partnerID=40&md5=f84bf1f263a92989b85cdb1a636aab7e
TOP