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, research has focussed on developing and testing heuristic algorithms which solve the CARP approximately. The author reviews some of the existing solution procedures, analyzes their complexity, and presents two modifications of the existing methods (construct-strike algorithm and path scanning algorithm) to obtain near-optimal solutions for the CARP. Extensive computational results are presented and analyzed.
Approximate solutions for the capacitated arc routing problem
Approximative Loesungen des Problems der Transportkapazitaet und der Reichweite
Computers and Operations Research ; 16 , 6 ; 589-600
1989
12 Seiten, 9 Quellen
Article (Journal)
English
Capacitated arc routing problem with extensions
British Library Conference Proceedings | 2005
|Heuristics for the periodic capacitated arc routing problem
Tema Archive | 2005
|Improved Genetic Algorithm for Capacitated Vehicle Routing Problem
British Library Conference Proceedings | 2013
|