| 时变网络环境下旅行商问题研究 |
| |
| 引用本文： | 李妍峰,李军,高自友.时变网络环境下旅行商问题研究[J].系统工程学报,2010,25(5). |
| |
| 作者姓名： | 李妍峰 李军 高自友 |
| |
| 作者单位： | 北京交通大学系统科学研究所;西南交通大学经济管理学院; |
| |
| 基金项目： | 国家自然科学基金重点资助项目，国家自然科学基会资助项目，国家973资助项目，国家科技部博士后基金，中央高校基本科研业务费专项资金资助项目 |
| |
| 摘 要： | 对时变旅行商问题进行描述,提出处理一般跨时段的新方法,并建立数学模型.在求解方法上构造动态搜索优化算法ds-k-opt(k=2,2.5,3)求解该问题.通过实验仿真,大部分动态搜索优化算法解质量优于动态规划启发式算法,且求解规模更大.动态搜索优化算法解随k值增大而更优,算法运行时间也随之增加.
|
| 关 键 词： | 时变旅行商问题 跨时段 动态搜索优化算法 动态规划启发式 |
Traveling salesman problem in time varying network |
| |
| LI Yan-feng,LI Jun,GAO Zi-you.Traveling salesman problem in time varying network[J].Journal of Systems Engineering,2010,25(5). |
| |
| Authors: | LI Yan-feng LI Jun GAO Zi-you |
| |
| Institution: | LI Yan-feng1,2,LI Jun2,GAO Zi-you1(1.Institute of Systems Science,Beijing Jiaotong University,Beijing 100044,China,2.Schoolof Economics and Management,Southwest Jiaotong University,Chengdu 610031,China) |
| |
| Abstract: | In this paper,the time varying traveling salesman problem(TDTSP) was formulated by dealing with general time periods crossing,and novel dynamic search optimization algorithms ds-k-opt(k=2,2.5,3) were developed to solve it.Through the simulation,the dynamic search optimization algorithms can solve larger size problem compared with dynamic programming heuristics.As for the solution quality,most solutions of dynamic search optimization algorithms are better than those of dynamic programming heuristics.The solu... |
| |
| Keywords: | time varying traveling salesman problem(TDTSP) time periods crossing dynamic search optimization algorithms dynamic programming heuristics |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
