關鍵字查詢 | 類別:期刊論文 | | 關鍵字:A modified ant colony system for solving the travelling salesman problem with time windows

[第一頁][上頁]1[次頁][最末頁]目前在第 1 頁 / 共有 01 筆查詢結果
序號 學年期 教師動態
1 96/1 資管系 鄭啟斌 教授 期刊論文 發佈 A modified ant colony system for solving the travelling salesman problem with time windows , [96-1] :A modified ant colony system for solving the travelling salesman problem with time windows期刊論文A modified ant colony system for solving the travelling salesman problem with time windows鄭啟斌; Cheng, Chi-bin; Mao, Chun-Pin淡江大學資訊管理學系Ant colony optimization (ACO);Travelling salesman problem with time windows (TSPTW);Meta-heuristic;Nature-inspired algorithmElsevierMathematical and Computer Modelling 46(9-10), pp.1125-1135The travelling salesman problem with time windows (TSPTW) involves finding the minimum cost tour in which all cities are visited exactly once within their requested time windows. This problem has a number of important practical applications, including scheduling and routing. The problem is regarded as NP-complete, and hence traditional optimization algorithms are inefficient when applied to solve larger scale TSPTW problems. Consequently, the development of approximation algorithms has received considerable attention in recent years. Ant colony optimization (ACO), inspired by
[第一頁][上頁]1[次頁][最末頁]目前在第 1 頁 / 共有 01 筆查詢結果