New Algorithms for the General Arc Routing Problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

New Algorithms for the General Arc Routing Problems


This paper considers an Extended version of the Capacitated Arc Routing Problem (E-CARP), obtained by adding several realistic constraints (including for example prohibited turns) to the basic CARP. We propose a resolution method to a mono objective and a hierarchical bi-objective optimization of the CARP. Our approach is based on: 1) a cutting plane algorithm to compute optimal solutions for medium-scale instances 2) a Genetic Algorithm for medium and large-scale instances. Dedicated crossover, mutations and construction heuristics for the initial population are presented for the E-CARP. The well-known construction heuristics have been adjusted taking into account the realistic constrains added to the basic CARP. A set of 11 benchmark problems with up to 16 nodes and 52 arcs is proposed to evaluate performances of the two approaches. The Xpress library is used to provide optimal solutions for small and medium size problems using the cutting plane algorithm. Using this approach about 50% E-CARP library problems have been optimally solved. The experiments prove that the GA is nearly optimal and remains still adequate for the bi-objective optimisation problem.
No file

Dates and versions

inria-00100227 , version 1 (26-09-2006)


  • HAL Id : inria-00100227 , version 1


Philippe Lacomme, Christian Prins, Wahiba Ramdane-Cherif. New Algorithms for the General Arc Routing Problems. [Intern report] A04-R-340 || lacomme04c, LORIA - Université de Lorraine. 2004, 15 p. ⟨inria-00100227⟩
92 View
0 Download


Gmail Facebook Twitter LinkedIn More