Approximate solutions for the capacitated arc routing problem

https://doi.org/10.1016/0305-0548(89)90044-0Get rights and content

Abstract

The capacitated arc routing problem (CARP), is a capacitated variation of the arc routing problems in which there is a capacity constraint associated with each vehicle. Due to the computational complexity of the problem, recent research has focussed on developing and testing heuristic algorithms which solve the CARP approximately. In this paper, we review some of the existing solution procedures, analyze their complexity, and present two modifications of the existing methods to obtain near-optimal solutions for the CARP. Extensive computational results are presented and analyzed.

References (9)

There are more references available in the full text version of this article.

Cited by (0)

Wen Lea Pearn received his PhD degree from University of Maryland. He was an Assistant Professor of Operations Research at California State University, Fresno, and is now with AT&T Bell Laboratories. His area of interest includes network optimization and probabilistic modeling. He has contributed articles to various journals in those areas.

View full text