GENERAL ARC ROUTING PROBLEMS SOLVED BY A CUTTING PLANE ALGORITHM AND A GENETIC ALGORITHM

This paper considers an extended version of the Capacitated Arc Routing Problem (E-CARP), obtained by adding realistic constraints like prohibited turns to the basic CARP. Two integer linear models are presented, a mono-objective version and a bi-objective one. A cutting plane method for the first v...

Full description

Saved in:
Bibliographic Details
Published inIFAC Proceedings Volumes Vol. 35; no. 1; pp. 493 - 498
Main Authors Lacomme, P., Prins, C., Ramdane-Chérif, W.
Format Journal Article
LanguageEnglish
Published 2002
Subjects
arc routing
genetic algorithm
linear programming
transportation
genetic algorithm
arc routing
linear programming
transportation
Online AccessGet full text
ISSN1474-6670
DOI10.3182/20020721-6-ES-1901.01550

Cover

More Information
Summary:This paper considers an extended version of the Capacitated Arc Routing Problem (E-CARP), obtained by adding realistic constraints like prohibited turns to the basic CARP. Two integer linear models are presented, a mono-objective version and a bi-objective one. A cutting plane method for the first version provides either an optimum or a lower bound that are used to benchmark a genetic algorithm on 11 CARP instances from the literature, enriched by additional constraints. The results prove the GA is nearly optimal for these networks with up to 16 nodes and 52 arcs.
ISSN:1474-6670
DOI:10.3182/20020721-6-ES-1901.01550