Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 33, Issue 12, Pages 3363-3383Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2005.02.009
Keywords
capacitated arc routing problem; mixed graph; lower bound; cutting plane; heuristic; memetic algorithm; waste collection
Ask authors/readers for more resources
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. (c) 2005 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available