摘要
针对带时间窗车辆路径问题,论文通过增加虚拟配送中心的数量,改进蚁群算法,从而将VRPTW问题转化为TSP问题进行求解,使每只蚂蚁都可以构建一条可行路径,避免在该问题中以往常由多只蚂蚁协同合作来构造解的低效性,通过实验计算表明该方法是可行的。
This paper puts forward a new improved ant colony algorithm for the Vehicle Routing Problem with Time Windows（VRPTW）.Through adding the unreal numbers of the depot it can change from VRPTW to m-TSP,It makes each ant be able to construct a feasible solution,and to avoid low efficiently by many ants coordinating a solution in VRPTW what happened before.The case study shows the algorithm is efficient.
出处
《计算机工程与应用》
CSCD
北大核心
2006年第29期218-219,225,共3页
Computer Engineering and Applications
关键词
车辆路径问题
带时间窗
蚁群算法
Vehicle Routing Problem,with time windows,ant colony algorithm
