Bibliographic Details
| Title: |
A branch-and-price algorithm for the windy rural postman problem. |
| Authors: |
Afsar, Hasan Murat1 murat.afsar@utt.fr, Jozefowiez, Nicolas2,3, Lopez, Pierre2,4 |
| Source: |
RAIRO -- Operations Research. Oct2011, Vol. 45 Issue 4, p353-364. 12p. |
| Subjects: |
Problem solving, Garbage collection (Computer science), Decomposition method, Mathematical programming, Numerical analysis |
| Abstract: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of RAIRO -- Operations Research is the property of EDP Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
