Lower and upper bounds for the mixed capacitated arc routing problem

José-Manuel Belenguer (1) , Enrique Benavent (1) , Philippe Lacomme (2) , Christian Prins (3)

1 UV - Universitat de València
2 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes
3 LOSI - Laboratoire d'Optimisation des Systèmes Industriels

This paper presents a linear formulation, valid inequalities, and a lower bounding procedure for the mixed capacitated arc routing problem (MCARP). Moreover, three constructive heuristics and a memetic algorithm are described. Lower and upper bounds have been compared on two sets of randomly generated instances. Computational results show that the average gaps between lower and upper bounds are 0.51% and 0.33%, respectively.

Mots clés: Memetic algorithm; Waste collection; Capacitated arc routing problem; Mixed graph; Lower bound; Cutting plane; Heuristic

Domaines: Modélisation et simulation; Recherche opérationnelle [math.OC]

José-Manuel Belenguer, Enrique Benavent, Philippe Lacomme, Christian Prins. Lower and upper bounds for the mixed capacitated arc routing problem. Computers and Operations Research, 2005, 33 (12), pp.3363-3383. ⟨10.1016/j.cor.2005.02.009⟩. ⟨hal-00119777⟩