Solving the Capacitated Arc Routing Problem with Time Windows using Column Generation
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.
|Date of creation:||26 Jan 2009|
|Date of revision:|
|Contact details of provider:|| Postal: |
Fax: + 45 86 15 19 43
Web page: http://www.asb.dk/about/departments/bs.aspx
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:hhb:aarbls:2008-009. See general 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.