摘要
为使多集散点车辆路径问题结果全局最优,以订单为基准建立货运车辆路径问题模型.以订单为基准建立蚁群算法的二维禁忌数组,确定相邻两个集散点相同时的蚂蚁状态转移规则,使蚁群在满足车辆约束条件下,按禁忌表对所有订单搜索.此模型和算法实现了所有车辆对所有订单进行路径搜索,易于全局最优.实例求解结果表明模型及算法的有效性.
In order to get the global solution in multi-depots vehicle routing problem （VRP）, VRP model based on detail order information was established. A two dimension tabu table based on orders was established for ant colony optimization algorithm, and state transfer rules were established when the two adjacent nodes were same. Then all the vehicle routs were searched by ants that satisfied the vehicle constrain according to ants tabu table. It is easy to get the global solution for model and algorithm implement the routs search of all vehicles to all orders. The illustration result shows that model and algorithm are effective for multi-depots vehicle routing problem.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2008年第2期143-147,共5页
Systems Engineering-Theory & Practice
基金
交通部科技项目(200439800060)
关键词
多集散点
车辆路径问题
蚁群算法
禁忌表
multi-depots
vehicle routing problem
ant colony optimization
tabu table
