Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation
AbstractIn 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 InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoPaper provided by University of Aarhus, Aarhus School of Business, Department of Business Studies in its series CORAL Working Papers with number L-2008-09.
Length: 19 pages
Date of creation: 26 Jan 2009
Date of revision:
Contact details of provider:
Postal: The Aarhus School of Business, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Fax: + 45 86 15 19 43
Web page: http://www.asb.dk/about/departments/bs.aspx
More information through EDIRC
CARP-TW; column generation; heuristics;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-05-09 (All new papers)
- NEP-CMP-2009-05-09 (Computational Economics)
- NEP-ORE-2009-05-09 (Operations Research)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Helle Vinbaek Stenholt).
If references are entirely missing, you can add them using this form.