首页 | 本学科首页   官方微博 | 高级检索  
     


Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
Authors:Gianpaolo Ghiani  Demetrio Laganà  Gilbert Laporte  Francesco Mari
Affiliation:1. Department of Innovation Engineering, University of Lecce, 73100, Lecce, Italy
2. Department of Electronics, Informatics and Systems, University of Calabria, 87036, Rende, CS, Italy
3. Canada Research Chair in Distribution Management, HEC Montréal, 3000 chemin de la C?te-Sainte Catherine, Montréal, H3T 2A7, Canada
4. Supercomputing Center for Computational Engineering (CESIC), NEC Italy, 87036, Rende, CS, Italy
Abstract:The aim of this paper is to introduce a new ant colony optimization procedure for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions (CLARPIF), a variant of the Capacitated Arc Routing Problem (CARP) and of the Capacitated Arc Routing Problem with Intermediate Facilities (CARPIF). Computational results show that this algorithm is capable of providing substantial improvements over other known heuristics.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号