A branch-and-price algorithm for the windy rural postman problem.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 98801862 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A branch-and-price algorithm for the windy rural postman problem. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Afsar%2C+Hasan+Murat%22">Afsar, Hasan Murat</searchLink><relatesTo>1</relatesTo><i> murat.afsar@utt.fr</i><br /><searchLink fieldCode="AR" term="%22Jozefowiez%2C+Nicolas%22">Jozefowiez, Nicolas</searchLink><relatesTo>2,3</relatesTo><br /><searchLink fieldCode="AR" term="%22Lopez%2C+Pierre%22">Lopez, Pierre</searchLink><relatesTo>2,4</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22RAIRO+--+Operations+Research%22">RAIRO -- Operations Research</searchLink>. Oct2011, Vol. 45 Issue 4, p353-364. 12p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Problem+solving%22">Problem solving</searchLink><br /><searchLink fieldCode="DE" term="%22Garbage+collection+%28Computer+science%29%22">Garbage collection (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Decomposition+method%22">Decomposition method</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+programming%22">Mathematical programming</searchLink><br /><searchLink fieldCode="DE" term="%22Numerical+analysis%22">Numerical analysis</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=98801862 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1051/ro/2012004 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 12 StartPage: 353 Subjects: – SubjectFull: Problem solving Type: general – SubjectFull: Garbage collection (Computer science) Type: general – SubjectFull: Decomposition method Type: general – SubjectFull: Mathematical programming Type: general – SubjectFull: Numerical analysis Type: general Titles: – TitleFull: A branch-and-price algorithm for the windy rural postman problem. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Afsar, Hasan Murat – PersonEntity: Name: NameFull: Jozefowiez, Nicolas – PersonEntity: Name: NameFull: Lopez, Pierre IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 10 Text: Oct2011 Type: published Y: 2011 Identifiers: – Type: issn-print Value: 03990559 Numbering: – Type: volume Value: 45 – Type: issue Value: 4 Titles: – TitleFull: RAIRO -- Operations Research Type: main |
| ResultId | 1 |
