procedures of the 48 cities tsp problem (document coordinates corresponding to the city 48. txt) to calculate the optimal solution of the path and road map are as follows.
程序对48个城市的tsp问题(城市坐标文件对应于48.txt)进行计算,求解路径和最优路径图如下。
genius algorithm is used to solve tsp problem in this algorithm. through this processing, not only better solution can be got, but also the likelihood of local optimal be reduced by perturbing sol…
采用genius算法处理其中的tsp问题,不仅能产生较好的解,而且通过对解的周期性的扰动,进一步减少求解陷于局部优化的可能性。
finally, the paper presents dna molecular algorithms and living examples of tsp problem based on sticker model.
最后给出了基于粘贴系统模型的tsp问题的dna分子算法和应用实例。
theoretically speaking, the enumeration not only can solve tsp problem but also can get the best answer.
从理论上讲,使用穷举法不但可以求解tsp问题,而且还可以求出该问题的最优解。
this paper introduces tsp problem and fundamental principle for genetic algorithm.
介绍tsp问题和遗传算法的基本原理。
based on the immune principles , this paper at first analyse the immune algorithm by solving tsp problem which improves the ability of population and increase the holistic performance.
本文利用免疫的有关概念和理论,先对免疫算法性能做分析,设计一个免疫算法求解tsp问题,验证基于免疫的算法有利于整体的相对稳定和性能的提高。
the tsp problem is solved by designing an auxiliary square window and utilizing a 「quadrilateral diagonal exchanging」 technique.
思路是设计一个矩形辅助窗口,并利用「四边形对角线交换」技术来获得简单多边形的三角剖分。
an improved genetic algorithm for tsp problem was provided.
阐述了一种针对tsp问题的改进遗传算法。
this paper mainly discusses the genetic algorithm solution method for tsp problem avoiding obstructions under complex environment.
主要探讨复杂环境下避障tsp问题的遗传算法的求解方法。
the convergent character of ia is tested using tsp problem and some test functions.
利用旅行商问题(tsp)、随机优化算法测试函数对免疫算法及其他算法进行了测试分析。
a mathematical model of tsp problem based on artificial immune system is established.
基于人工免疫原理,建立了一个基于免疫机制求解tsp问题的数学模型。
the tsp problem is considered as classical optimization grouping problem, which is widely used in practice, but it is real a difficult np problem.
旅行商问题作为经典的组合优化问题,实际中的应用非常广泛,但它却是一个np完全问题。