Evolutionary Algorithms for the Open Shop Visitor Routing Problem with Fixed Visiting Times
碩士 === 國立虎尾科技大學 === 工業工程與管理研究所 === 102 === This study investigates the Open Shop Visitor Routing Problem with Fixed Visiting Times (OSVRP-FVT) which is an extension of Open Shop Scheduling Problem (OSSP) and an NP-hard problem. In the OSVRP-FVT, the visitor groups and exhibit rooms can be treated as...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/4q926b |