Johnson, Ellis L. (School of Industrial and Systems Engineering) Wøhlk, Sanne () (Department of Business Studies, Aarhus School of Business)
Abstract
In this paper we consider the Capacitated Arc Routing Problem with Time windows. We suggest two algorithms for solving the problem to optimality and a heuristic for obtaining high quality solutions. To our knowledge this is the first paper to consider optimal solution of that problem.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Aarhus, Aarhus School of Business, Department of Business Studies in its series CORAL Working Papers with number
L-2008-09.