期刊論文
| 學年 | 96 |
|---|---|
| 學期 | 1 |
| 出版（發表）日期 | 2007-11-01 |
| 作品名稱 | A modified ant colony system for solving the travelling salesman problem with time windows |
| 作品名稱（其他語言） | |
| 著者 | 鄭啟斌; Cheng, Chi-bin; Mao, Chun-Pin |
| 單位 | 淡江大學資訊管理學系 |
| 出版者 | Elsevier |
| 著錄名稱、卷期、頁數 | Mathematical and Computer Modelling 46(9-10), pp.1125-1135 |
| 摘要 | The 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 the foraging behaviour of real ants, is one of the most attractive approximation algorithms. Accordingly, this study develops a modified ant algorithm, named ACS-TSPTW, based on the ACO technique to solve the TSPTW. Two local heuristics are embedded in the ACS-TSPTW algorithm to manage the time-window constraints of the problem. The numerical results obtained for a series of benchmark problem instances confirm that the performance of the ACS-TSPTW is comparable to that of ACS-Time, an existing ACO scheme for solving the TSPTW problem. |
| 關鍵字 | Ant colony optimization (ACO);Travelling salesman problem with time windows (TSPTW);Meta-heuristic;Nature-inspired algorithm |
| 語言 | en |
| ISSN | 0895-7177 |
| 期刊性質 | 國外 |
| 收錄於 | |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 否 |
| 國別 | GBR |
| 公開徵稿 | |
| 出版型式 | ,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/21084 ) |