Description: 利用模拟退火算法解决旅行商问题，共二十个城市，选择最优路径-The use of simulated annealing algorithm to solve traveling salesman problem Platform: |
Size: 55296 |
Author:wujian |
Hits:
Description: 全书包括两部分共15章。第1章指出问题求解困难的原因；第2章简要介绍几本概念；第3-5章分别综述穷举搜索法、局部搜索法、贪婪法、分而治之法、动态规划法、分支定界法、模拟退火法和禁忌搜索法；第6-7章介绍一般演化算法的细节问题；第8-10章介绍如何采用演化方法求解TSP问题、处理约束条件以及算法调整；第11章讨论了环境和噪声问题；第12-13分别提供神经网络和模糊系统相关内容；第14章对混合系统和扩展演化算法做简短讨论；第15章介绍演化算法在实际问题中的应用，并给出有价值的提示。-The book includes two parts with 15 chapters. The first chapter points out the reasons for the problem solving difficult the second chapter briefly introduces some of the concepts Chapter 3-5 respectively in exhaustive search, local search, greedy, divide and rule method, dynamic programming, branch and bound method, simulated annealing and tabu search method 6-7 chapter details the general evolution algorithm how to 8-10 chapter introduces evolution method for solving TSP problem, constraint conditions and algorithm the eleventh chapter discusses the environment and the problem of noise the 12-13 respectively with neural network and fuzzy system related content the fourteenth chapter on the mixing system and evolution algorithm is briefly discussed the fifteenth chapter introduces the application of evolutionary algorithm in practical problems, and gives valuable hints. Platform: |
Size: 10104832 |
Author:alvin |
Hits:
Search - dynamic TSP simulated annealing