【摘要】 基于有容量限制的路径优化(CVRP)问题的NP难解性,将目前已在众多组合优化领域中颇见成效的随机型智能搜索算法——蚂蚁算法结合节约算法(C-W算法)应用于这类模型,充分发挥了其智能搜索、全局优化和并行计算的优势。经算例测试,比较蚂蚁算法与两阶段法、神经网络算法的迭代过程,结果表明,蚂蚁算法能以较快的速度收敛到最优解。更多还原

【Abstract】 The problem to be addressed is a Capacitated VehicleRouting Problem (CVRP). Due to the NP-hardness of this problem,antsh euristic,ac onstructives tochastici ntelligences earchinga lgorithm,combined with Clarke-Wright algorithm is extended for solving theclass of vehicle routing models. In this paper,a numerical experi-ment shows the effectiveness of the proposed algorithm comparedwith Two-phase method and Neural Netwoks.更多还原