Journal
JOURNAL OF HEURISTICS
Volume 16, Issue 2, Pages 211-233Publisher
SPRINGER
DOI: 10.1007/s10732-008-9097-8
Keywords
Capacitated arc routing problem; Ant colony optimization; Intermediate facilities; Capacity and distance restrictions
Funding
- Ministero dell' Istruzione, dell' Universitae della Ricerca Scientifica (MIUR)
- Center of Excellence on High Performance Computing, University of Calabria, Italy
- Canadian Natural Sciences and Engineering Research Council [05-39682]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
