Using Artificial Intelligence Algorithms for the Museum Routing Problem with Multi-Select and Fixed Visting Time Constraints
碩士 === 國立虎尾科技大學 === 工業管理系工業工程與管理碩士班 === 105 === This thesis investigates a new multi-select museum routing problem (MS-MVRP) in which a number of groups visit several exhibition rooms in a museum simultaneously. The exhibition rooms are divided into two categories: (a) a set of must-see exhibition r...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/7rx66q |