ALGORITHMS FOR THE RURAL POSTMAN PROBLEM
| dc.citation.epage | 828 | en_US |
| dc.citation.issue | 8 | en_US |
| dc.citation.spage | 819 | en_US |
| dc.citation.volume | 22 | en_US |
| dc.citation.woscount | 17 | |
| dc.contributor.author | PEARN, WL | en_US |
| dc.contributor.author | WU, TC | en_US |
| dc.contributor.department | 工業工程與管理學系 | zh_TW |
| dc.contributor.department | Department of Industrial Engineering and Management | en_US |
| dc.date.accessioned | 2014-12-08T15:03:09Z | |
| dc.date.available | 2014-12-08T15:03:09Z | |
| dc.date.issued | 1995-10-01 | en_US |
| dc.description.abstract | The rural postman problem (RPP) is a practical extension of the well-known Chinese postman problem (CPP), in which a subset of the edges (streets) from the road network are required to be traversed at a minimal cost. The RPP is NP-complete if this subset does not form a weakly connected network. Therefore, it is unlikely that polynomial-time bounded algorithms exist for the problem. In this paper, we review the existing heuristic solution procedures, then present two new algorithms to solve the problem near-optimally. Computational results showed that the proposed new algorithms significantly outperformed the existing solution procedures. | en_US |
| dc.identifier.issn | 0305-0548 | en_US |
| dc.identifier.journal | COMPUTERS & OPERATIONS RESEARCH | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/1710 | |
| dc.identifier.wosnumber | WOS:A1995RE79600005 | |
| dc.language.iso | en_US | en_US |
| dc.title | ALGORITHMS FOR THE RURAL POSTMAN PROBLEM | en_US |
| dc.type | Article | en_US |