完整後設資料紀錄
DC 欄位語言
dc.contributor.authorPEARN, WLen_US
dc.contributor.authorWU, TCen_US
dc.date.accessioned2014-12-08T15:03:09Z-
dc.date.available2014-12-08T15:03:09Z-
dc.date.issued1995-10-01en_US
dc.identifier.issn0305-0548en_US
dc.identifier.urihttp://hdl.handle.net/11536/1710-
dc.description.abstractThe 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.language.isoen_USen_US
dc.titleALGORITHMS FOR THE RURAL POSTMAN PROBLEMen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTERS & OPERATIONS RESEARCHen_US
dc.citation.volume22en_US
dc.citation.issue8en_US
dc.citation.spage819en_US
dc.citation.epage828en_US
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:A1995RE79600005-
dc.citation.woscount17-
顯示於類別:期刊論文


文件中的檔案:

  1. A1995RE79600005.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。