蚁群优化算法
车辆路径问题
遗传算法
算法
数学优化
元优化
计算机科学
蚁群
分布(数学)
元启发式
布线(电子设计自动化)
数学
计算机网络
数学分析
标识
DOI:10.23977/iotea.2016.11003
摘要
To solve the problem of vehicle routing problem under capacity limitation, this paper puts forward a novel method of logistics distribution route optimization based on genetic algorithm and ant colony optimization algorithm (GA-ACO). On the first stage, improved genetic algorithm with a good global optimization searching ability is used to find the feasible routes quickly. On the second stage, the result of the genetic algorithm is used as the initial solution of the ant colony algorithm to initialize the pheromone. And then improved ant colony optimization algorithm is used to find the optimal solution of logistics distribution route. Experimental results show that the optimal or nearly optimal solutions of the logistic distribution routing can be quickly obtained by this two stages method.
科研通智能强力驱动
Strongly Powered by AbleSci AI