摘要
Many real world optimization problems are related with time and some of them can be modeled by the Dynamic TSP(DTSP). A DTSP is harder than a general TSP, which is a NP-hard problem, because the city number of the DTSP is time varying. In the paper, first give a mathematical model for DTSP. Then discuss the GT algorithm which is a algorithm solve static TSP problem. Based on GT algorithm, proposed an evolutionary algorithm, which can solve DTSP problem, give its detail describe, analyze its character and give a graph of CHN144+1 problem. At the end, conclude the paper and give the research area in future.
| 源语言 | 英语 |
|---|---|
| 页 | 2271-2274 |
| 页数 | 4 |
| 出版状态 | 已出版 - 2004 |
| 已对外发布 | 是 |
| 活动 | WCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings - Hangzhou, 中国 期限: 15 6月 2004 → 19 6月 2004 |
会议
| 会议 | WCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings |
|---|---|
| 国家/地区 | 中国 |
| 市 | Hangzhou |
| 时期 | 15/06/04 → 19/06/04 |
指纹
探究 'TSP problem based on dynamic environment' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver