Article ID Journal Published Year Pages File Type
476163 Computers & Operations Research 2006 21 Pages PDF
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.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, , , ,