Algorithms for the Windy Postman Problem

W.l. Pearn*, Lin Li Mao Lin Li

*Corresponding author for this work

研究成果: Article同行評審

10 引文 斯高帕斯(Scopus)

摘要

The Windy Postman Problem (WPP), is an interesting generalization of the classical Chinese Postman Problem (CPP), which has many real-world applications. The WPP has been shown to be NP-complete; therefore, it is difficult to solve the problem exactly. For this reason, heuristic solution procedures have been proposed to solve the problem approximately. In this paper, we first review the existing solution procedures, then introduce two new algorithms to solve the WPP near-optimally. Computational results show that the new algorithms outperform the existing solution procedures on some special class of networks.

原文English
頁(從 - 到)641-651
頁數11
期刊Computers and Operations Research
21
發行號6
DOIs
出版狀態Published - 1 一月 1994

指紋 深入研究「Algorithms for the Windy Postman Problem」主題。共同形成了獨特的指紋。

引用此