论文标题
鲤鱼的第一个竞争性蚂蚁殖民计划
First Competitive Ant Colony Scheme for the CARP
论文作者
论文摘要
本文使用蚂蚁菌落优化方案解决了电容的电弧路由问题（CARP）。蚂蚁菌落方案可以计算VRP中等实例的解决方案。拟议的蚂蚁殖民地专门用于大规模的鲤鱼实例，其中有140多个节点和190个弧线。蚂蚁菌落方案与当地搜索程序相结合，并提供高质量的解决方案。我们进行的基准证明，当有足够数量的迭代专用于蚂蚁时，可以使用这种方案获得盈利的解决方案。它与Lacomme等人的遗传算法竞争。关于解决方案质量，但在大规模实例上更耗时。该方法已在众所周知的Eglese，Dearmon和Belenguer和Benavent的最后一个实例上进行了基准测试。该研究报告是蚂蚁殖民地的一步前进的鲤鱼，证明蚂蚁方案可以与禁忌搜索方法和遗传算法竞争
This paper addresses the Capacitated Arc Routing Problem (CARP) using an Ant Colony Optimization scheme. Ant Colony schemes can compute solutions for medium scale instances of VRP. The proposed Ant Colony is dedicated to large-scale instances of CARP with more than 140 nodes and 190 arcs to service. The Ant Colony scheme is coupled with a local search procedure and provides high quality solutions. The benchmarks we carried out prove possible to obtain solutions as profitable as CARPET ones can be obtained using such scheme when a sufficient number of iterations is devoted to the ants. It competes with the Genetic Algorithm of Lacomme et al. regarding solution quality but it is more time consuming on large scale instances. The method has been intensively benchmarked on the well-known instances of Eglese, DeArmon and the last ones of Belenguer and Benavent. This research report is a step forward CARP resolution by Ant Colony proving ant schemes can compete with Taboo search methods and Genetic Algorithms
