Title of article
Lower and upper bounds for the mixed capacitated arc routing problem
Author/Authors
José-Manuel Belenguer، نويسنده , , Enrique Benavent، نويسنده , , Philippe Lacomme، نويسنده , , Christian Prins، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2006
Pages
21
From page
3363
To page
3383
Abstract
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.
Keywords
Memetic algorithm , Capacitated arc routing problem , Heuristic , Lower bound , Cutting plane , Mixed graph , Waste collection
Journal title
Computers and Operations Research
Serial Year
2006
Journal title
Computers and Operations Research
Record number
928825
Link To Document