跳到主要导航 跳到搜索 跳到主要内容

TSP problem based on dynamic environment

  • Xue Song Yan*
  • , Ai Min Zhou
  • , Li Shan Kang
  • , Yu Ping Chen
  • *此作品的通讯作者

科研成果: 会议稿件论文同行评审

摘要

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月 200419 6月 2004

会议

会议WCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings
国家/地区中国
Hangzhou
时期15/06/0419/06/04

指纹

探究 'TSP problem based on dynamic environment' 的科研主题。它们共同构成独一无二的指纹。

引用此