國立虎尾科技大學 |

Language: English

Back

應用人工智慧演算法於多選擇性及固定參觀時間之博物館路徑問題 = = Us...

涂榮城

應用人工智慧演算法於多選擇性及固定參觀時間之博物館路徑問題 = = Using Artificial Intelligence Algorithms for the Museum Routing Problem with Multi-Select and Fixed Visting Time Constraints /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	應用人工智慧演算法於多選擇性及固定參觀時間之博物館路徑問題 =/ 涂榮城撰.
Reminder of title:	Using Artificial Intelligence Algorithms for the Museum Routing Problem with Multi-Select and Fixed Visting Time Constraints /
remainder title:	Using Artificial Intelligence Algorithms for the Museum Routing Problem with Multi-Select and Fixed Visting Time Constraints.
Author:	涂榮城
Published:	雲林縣 :國立虎尾科技大學 , : 民106.06.,
Description:	[8], 73面 :圖, 表 ; : 30公分.;
Notes:	指導教授：謝益智.
Subject:	新的博物館路徑問題. -
Online resource:	http://cetd.lib.nfu.edu.tw/etdservice/view_metadata?etdun=U0028-0607201711102400

應用人工智慧演算法於多選擇性及固定參觀時間之博物館路徑問題 = = Using Artificial Intelligence Algorithms for the Museum Routing Problem with Multi-Select and Fixed Visting Time Constraints /
涂榮城

應用人工智慧演算法於多選擇性及固定參觀時間之博物館路徑問題 =Using Artificial Intelligence Algorithms for the Museum Routing Problem with Multi-Select and Fixed Visting Time Constraints /Using Artificial Intelligence Algorithms for the Museum Routing Problem with Multi-Select and Fixed Visting Time Constraints.涂榮城撰. - 初版. - 雲林縣 :國立虎尾科技大學 ,民106.06. - [8], 73面 :圖, 表 ;30公分.

指導教授：謝益智.

含參考書目.Subjects--Topical Terms:

1045414
新的博物館路徑問題.

應用人工智慧演算法於多選擇性及固定參觀時間之博物館路徑問題 = = Using Artificial Intelligence Algorithms for the Museum Routing Problem with Multi-Select and Fixed Visting Time Constraints /
LDR:00969nam a2200181 i 450 001 875792
008 171023s2017 xx ak frm 000 0 chi d
040 $a NFU $b chi $c NFU $e CCR
041 0 # $a chi $b chi $b eng
084 $a 008.169M $b 3894:2 106 $2 ncsclt
100 1 $a 涂榮城 $q (Rong-Cheng Tu) $3 1125358
245 1 0 $a 應用人工智慧演算法於多選擇性及固定參觀時間之博物館路徑問題 = $b Using Artificial Intelligence Algorithms for the Museum Routing Problem with Multi-Select and Fixed Visting Time Constraints / $c 涂榮城撰.
246 3 1 $a Using Artificial Intelligence Algorithms for the Museum Routing Problem with Multi-Select and Fixed Visting Time Constraints.
250 $a 初版.
260 # $a 雲林縣 : $b 國立虎尾科技大學 , $c 民106.06.
300 $a [8], 73面 : $b 圖, 表 ; $c 30公分.
500 $a 指導教授：謝益智.
500 $a 碩士論文--國立虎尾科技大學工業管理系工業工程與管理碩士班.
504 $a 含參考書目.
650 # 4 $a 新的博物館路徑問題. $3 1045414
650 # 4 $a 粒子群演算法. $3 995663
650 # 4 $a 基因演算法. $3 995674
650 # 4 $a 免疫演算法. $3 995673
650 # 4 $a Museum Routing Problem. $3 1017181
650 # 4 $a GeneticAlgorithm. $3 1125906
650 # 4 $a Particle Swarm Optimization. $3 995657
650 # 4 $a Immune Algorithm. $3 995668
856 4 # $u http://cetd.lib.nfu.edu.tw/etdservice/view_metadata?etdun=U0028-0607201711102400