Using Orienteering Problem (OP) Algorithm to solve Maximum Benefit Chinese Postman Problem (MBCPP)
碩士 === 國立交通大學 === 工業工程與管理系所 === 92 === The Maximum Benefit Chinese Postman Problem (MBCPP) is a practical generalization of the classical Chinese Postman Problem (CPP), which has many real-world applications. The MBCPP has been shown to be more complex than the Traveling Salesman Problem (TSP), and...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/64025991659643348356 |
| Summary: | 碩士 === 國立交通大學 === 工業工程與管理系所 === 92 === The Maximum Benefit Chinese Postman Problem (MBCPP) is a practical generalization of the classical Chinese Postman Problem (CPP), which has many real-world applications. The MBCPP has been shown to be more complex than the Traveling Salesman Problem (TSP), and therefore it is difficult to solve the problem exactly. In this paper, we consider the MBCPP on totally undirected networks. We first present a simple network transformation to convert the MBCPP into the Orienteering Tour Problem (OTP), a well-known network routing problem that has been investigated extensively. Consequently, the MBCPP may be solved using the existing OTP solution procedures. We then present a modification of the Tsiligirides’ algorithm to solve the MBCPP approximately. The proposed modified Tsiligiride’s algorithm showed significantly effectiveness after tests by using the cost and benefit structure considered in Malandraki and Daskin (1993). Extensive computational results are provided and analyzed.
|
|---|