Using Artificial Intelligence Algorithms for the Museum Routing Problem with Capacity and Fixed Visting Time Constraints
碩士 === 國立虎尾科技大學 === 工業管理系工業工程與管理碩士班 === 104 === This thesis explored a new Museum Routing Problem with capacity and fixed visiting time constrains. In this problem, there are two types of exhibition rooms for visitors. First type is the must-visit exhibition rooms, and it means that all visitor gro...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/6gx853 |