摘要
带时间窗口的车辆路径问题(VRPTW)是一个NP-Complete优化问题。VRPTW的主要目标在于利用最少的车辆数以及最短的行程来服务客户,客户有固定的需求和被服务的时间限制。基于该问题提出了一种并行多蚁群算法(PMACS-VRPTW):首先利用QUICK-ACS生成初始解,然后利用ACS-VEI和ACS-TIME分别优化车辆数和行程距离。试验表明,所提出的算法基于Solomon的VRPTW基准实例获得了很好的结果。
Vehicle routing problem with time windows （VRPTW） is an NP-eomplete optimization problem. The objective of VRFTW is to use a fleet of vehicles with specific capacity to serve a number of customer with fixed demand and time window constraints. A parallel multiple ant colony system （PMACS-VRPTW） is proposed to solve this problem. QUICS-ACS is used to generate the initial solution, then ACS-VEI and ACS-TIME are used to optimize the vehicle number and travel distance seperately. Numerical results shows that the proposed algorithm is very effective on Solomon＇s benchmarks of VRFTW.
出处
《控制工程》
CSCD
2006年第2期127-129,134,共4页
Control Engineering of China
