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 |