Using Artificial Intelligence Algorithms for the Museum Routing Problem with Immediate Visiting and Capacity Constraints
碩士 === 國立虎尾科技大學 === 工業管理系工業工程與管理碩士班 === 107 === With the development of history, in order to avoid the destruction of historical relics and preserve cultural heritage, through the museum, some cultures can be preserved and tourism benefits can be created and entertainment, cultural landscapes and ed...
Main Authors: | HUANG, YU-LUN, 黃郁倫 |
---|---|
Other Authors: | HSIEH, YI-CHIH |
Format: | Others |
Language: | zh-TW |
Published: |
2019
|
Online Access: | http://ndltd.ncl.edu.tw/handle/tu34c7 |
Similar Items
On a Nonstationary Route Problem with Constraints
by: A. G. Chentsov, et al.
Published: (2015-02-01)
by: A. G. Chentsov, et al.
Published: (2015-02-01)
Similar Items
-
Using Artificial Intelligence Algorithms for the Museum Routing Problem with Capacity and Fixed Visting Time Constraints
by: Hao-Jun Lee, et al.
Published: (2016) -
Applications of Artificial Intelligence Algorithms for Museum Routing Problems
by: Jia-Shun Chen, et al.
Published: (2014) -
Using Artificial Intelligence Algorithms for the Museum Routing Problem with Multi-Select and Fixed Visting Time Constraints
by: Rong-Cheng Tu, et al.
Published: (2017) -
Using Artificial Intelligence Algorithms for the New Museum Routing Problem
by: Tsung-Yu Tsai, et al.
Published: (2015) -
Artificial Intelligence Approaches for the Optimal Disinfection Operations of Vehicle Routing Problem with Time Windows
by: Zong-Lun Deng, et al.
Published: (2010)