Lower and upper bounds for the mixed capacitated arc routing problem - Archive ouverte HAL
Article Dans Une Revue Computers and Operations Research Année : 2005

Lower and upper bounds for the mixed capacitated arc routing problem

Résumé

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.

Dates et versions

hal-00119777 , version 1 (12-12-2006)

Identifiants

Citer

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⟩
71 Consultations
0 Téléchargements

Altmetric

Partager

More