搜索资源列表
AHybidGeneticAgorithmtoSolveTS
- 求解TSP和MTSP的混合遗传算法_英文_,Abstract:M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup cit ies and returns the same start ing city. The to tal length of all subtours is required to be m ini2 mum. Th is is called
TSPandMTSP
- MTSP 问题其实与单 旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条 件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。-M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup c
knapsack-ga
- knapsack genet algorithm
Sophisticated-Fuzzy-Logic-Controllers-Using-Genet
- Sophisticated Fuzzy Logic Controllers Using Genetic Algorithms
Opposition-based-Stud-Genet
- 为进一步提高螺栓遗传算法的优化效率，加速寻优过程，提出基于对立策略的螺栓遗传算法。该算法在种群初始化阶段和变异阶段均用对立取代随机方式，提高产生解的质量。利用测试函数对算法的效率进行检验，将其与差分算法、遗传算法、粒子群算法和螺栓遗传算法进行对比，结果表明，新算法具有更快的收敛速度和更高的求解精度。-In order to improve the performance of Stud Genetic Algorithm(SGA) and accelerate the convergence s
DE
- DE codes for features mutasyon seleksiyon