期刊文献+

基于聚类描述的培养算子与TSP求解 被引量:1

Culture operator based on clustering description and its application to TSP
下载PDF
导出
摘要 首先提出用聚类树描述TSP对象的新方法;并在此基础上,提出了培养算子的基本概念和方法,以进一步改进解的质量. 对多个TSP实例求解的实验表明,基于聚类描述的培养算子对TSP的求解具有良好的效果. A new method is proposed to describe TSP instances in clustering trees. Based on that, the basic concept and fundamental method of culture operator are introduced to further improve the solution quality. The result of solving a number of TSP instances are given and it is proved that the culture operator approach based on clustering description can bring good quality to TSP solutions.
出处 《上海理工大学学报》 EI CAS 2000年第3期212-216,共5页 Journal of University of Shanghai For Science and Technology
关键词 组合最优化 TSP 聚类 遗传算法 培养算子 combinatorial optimization TSP clustering genetic algorithm
  • 相关文献

参考文献6

  • 1Cray M R,Johnson D S.Computers and Intractability:A Guide to the Theory of NPCompleteness[M].New York:Freeman,1979
  • 2Reinelt G.The traveling salesman:computational solutions for TSP applications[A].Lecture Notes in Computer Science[M].Berling:Springer-Verlag,1994,840
  • 3Grefenstette J,Gopal R,Rosimaita B.Genetic algorithms for the traveling salesman problem[A].Proc Int Genetic Algorithms and Their Applications Conference[C],1985.160~ 168
  • 4Johnson D S,McGeoch L A.Traveling Salesman Problem:A Case Study in Local Optimization[M].New York:Wiley and Sons,1996
  • 5Kirkpatrick S,Gelatt C D,Vecchi M P Optimization by Simulated Annealing[J].Science,1983,220:671~680
  • 6Reinelt G.TSPLIB-A Traveling Salesman Problem Library[J].ORSA Journal on Computing,1991,3(4),376~384

同被引文献6

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部