Volume 45, Number 4, October-December 2011
|Page(s)||353 - 364|
|Published online||09 March 2012|
A branch-and-price algorithm for the windy rural postman problem
Universitéde Technologie de Troyes (UTT), Institut Charles
Delaunay, LOSI, 12 rue Marie
2 CNRS, LAAS, 7 avenue du Colonel Roche, 31077 Toulouse Cedex 4, France
3 Université de Toulouse, INSA, LAAS, 31400 Toulouse, France
4 Université de Toulouse, LAAS, 31400 Toulouse, France
Received: 6 December 2011
Accepted: 31 January 2012
In this paper, we propose an exact solution method for the windy rural postman problem (WRPP). The motivation to study this problem comes from some real-life applications, such as garbage collecting in a predefined sector with hills, where the traversing or the servicing speed can change following the direction. We present a Dantzig-Wolfe decomposition and a branch-and-price algorithm to solve the WRPP. To the best of our knowledge, Dantzig-Wolfe decomposition has never been used to solve that problem. The numerical results show that optimal solutions are found in a very reasonable amount of time on instances with up to 100 nodes and 180 edges.
Mathematics Subject Classification: 90B06 / 90C10
Key words: Branch-and-price / windy rural postman problem
© EDP Sciences, ROADEF, SMAI, 2012
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.