Search - local search algorithm

Search - local search algorithm - List

[AI-NN-PR] 优化TSP局部搜索法 DL : 0: TSP算法，应用局部搜索法得到最优路径，已经经过优化。没有密码，可以使用，vc环境下使用。-TSP algorithm, using local search to be optimal path has been optimized. No password can be used, vc environments.
Date : 2026-01-02 Size : 1.29mb User : 霍哲
[AI-NN-PR] updatesimplexmethod DL : 0: 单纯形法是一种不错的随机搜索算法，但是其受初始值的选取，步长大小的影响较大，容易陷入局部收敛。程序中列出了基本单纯形法，和几种改进的单纯形法，包括变步长的单纯形法，单纯形加遗传算法等。-simplex method is a good random search algorithm, but its initial value by the selection, step in a larger size, easy to be trapped into local convergence. Procedures set out the basic simplex method, and several improved simplex method, including variable step of the simplex method. Simplex increase genetic algorithm.
Date : 2026-01-02 Size : 58kb User : xcq
[AI-NN-PR] Queen DL : 0: 局部搜索法求解N皇后问题。这个算法的特点是引入随机因素，每次运行并不能保证求得问题的最优解，但经过运行之后，一般总能得到一个与最优解相差不大的满意解。-Local Search Method for Solving N Queens problem. The algorithm is characterized by the introduction of random factors, each running and can not guarantee to achieve the optimal solution of the problem, but after running, the general always be an optimal solution is no less than satisfactory solution.
Date : 2026-01-02 Size : 1kb User : 清和信平
[AI-NN-PR] kmlocal-1.7.1.tar DL : 0: 高效的k-means算法实现，使用了k-d树与局部搜索等提高k-means算法的执行效率，同时包含示例代码，用c++代码实现。 Effecient implementation of k-means algorith, k-d tree and local search strategy are implementd to improve the effeciency, samples are included to show how to use it. All codes are implemented in C++.-Efficient k-means algorithm, the use of a kd tree with local search, such as k-means algorithm to improve the implementation efficiency of the sample code included with c++ Code. Effecient implementation of k-means algorith, kd tree and local search strategy are implementd to improve the effeciency, samples are included to show how to use it. All codes are implemented in C++.
Date : 2026-01-02 Size : 886kb User : 陈明
[AI-NN-PR] iga DL : 0: 应用遗传算法是被认为求解NP难题的有效手段之一,求解物流配送车辆路径优化问题时,在传统遗传算法的基础上,并引入了免疫算法的思想,实验结果表明该算法具有更好的全局和局部搜索能力和收敛速度,可有效地解决物流配送车辆路径优化问题。-Application of genetic algorithms to solve NP is considered an effective means of problem solving to optimize logistics and distribution vehicle routing problem, in the traditional genetic algorithm based on immune algorithm and the introduction of ideas, experimental results show that the algorithm has a better overall and local search ability and convergence speed, which can effectively solve the logistics and distribution VRP.
Date : 2026-01-02 Size : 7kb User : 王博文
[AI-NN-PR] memetic_for_TSP DL : 0: TSP问题是组合优化中的经典问题。其解决方法有局部优化方法和一些启发式算法,局部搜索方法充分考虑问题的邻域结构,遗传算法有很好的全局搜索能力,memetic算法把遗传算法和局部优化算法相结合,试验结果证明,能很好地解决TSP问题。-TSP problem is a classic combinatorial optimization problem. Its solution has a number of local optimization methods and heuristic algorithms, local search methods take full account of the issue of neighborhood structure, genetic algorithm has good ability of global search, memetic algorithm for the genetic algorithm and local optimization algorithm combining test results proved that well positioned to solve the TSP problem.
Date : 2026-01-02 Size : 100kb User : 文龙
[AI-NN-PR] pso_pathplanning DL : 0: 粒子群(PSO)路径规划。这个是一个局部路径规划，用了深度优先搜索算法，可以走出“陷阱”。-Particle Swarm (PSO) path planning. This is a local path planning, with a depth-first search algorithm, we can get out a
Date : 2026-01-02 Size : 9kb User : 陈建胜
[AI-NN-PR] 3 DL : 0: A Genetic Algorithm Hybridized with Local Search Operator
Date : 2026-01-02 Size : 102kb User : xig
[AI-NN-PR] SAGAHillClimbing DL : 0: Simulated Annealing SA Hill Climbing HC Local Beam Search LBS Genetic Algorithm GA -Simulated Annealing SA Hill Climbing HC Local Beam Search LBS Genetic Algorithm GA
Date : 2026-01-02 Size : 3kb User : mashomid
[AI-NN-PR] ModernAlgorithmCosole DL : 0: 多进程实现现代优化算法包括采用SSS的局部搜索、禁忌搜索算法和模拟退火算法的控制台-a console platform for modern optimization algorithm such as sss based local search taboo search and simulated annealing algorithm and so on
Date : 2026-01-02 Size : 6.91mb User : liushaofang
[AI-NN-PR] local_search DL : 0: 运用局部搜索算法实现旅行商问题。作者：陈华昌-The use of local search algorithm traveling salesman problem. Author: Chen Huachang
Date : 2026-01-02 Size : 8kb User : chc
[AI-NN-PR] powell DL : 0: 课程学习图形配准中的优化问题时进行局部搜索的powell算法，程序代码注解详细，可运行，适合初学智能算法的朋友-Courses in graphic registration of optimization problems for local search powell algorithm, code comment in detail, can run, suitable for beginners intelligent algorithm friend
Date : 2026-01-02 Size : 714kb User : 魏晨曦
[AI-NN-PR] Immune_Chaotic_Network_Algorithm_for_Multimodal_Fu DL : 0: 针对多峰函数优化问题，借鉴混沌遍历特性和免疫网络理论，提出一种免疫混沌网络算法。算法利用混沌运动的自身规律在不同的峰值区域内搜索最佳抗体，增强了算法的局部搜索能力；采用网络抑制策略，保持了种群的多样性；通过网络补充机制自适应地调节抗体群的规模，提高了算法对不同类型多峰函数的适应能力。仿真结果表明该算法能有效地改善种群的多样性，较好地保持全局搜索和局部搜索的动态平衡，具有更强的多峰函数优化能力-Referred to the ergodicity of chaos and immune network theory, an immune chaotic network algorithm for multimodal function optimization was proposed. The rule of chaotic motion was used to search the best antibodies in different peak regions in order to enhance the capacity of local search. The strategy of network suppression was adopted to maintain the diversity of population. Under the action of network supplement mechanism, the scale of antibody population was adjusted to adapt different types of multimodal function. Simulation results show that the algorithm can not only improve population diversity effectively, but also keep the dynamic balance between global search and local search well. Therefore, it has excellent optimization performance to multimodal function.
Date : 2026-01-02 Size : 1.04mb User : 崔冰
[AI-NN-PR] Rectangle DL : 0: 矩形件优化排样是一个NPC问题，在工业界有着广泛的应用．针对该问题，提出一种自适应模拟退火遗传算法．采用一种基于环形交叉算子和环形变异算子的自适应遗传算法来自动调整交叉和变异概率；同时引入模拟退火算法对个体适应度大于平均适应度的个体进行退火处理．自适应模拟退火遗传算法充分发挥了自适应遗传算法与模拟退火算法各自的全局搜索能力与局部搜索能力．对比实验表明，该算法结合改进的最左最下布局算法解决矩形件优化排样问题更加有效．-Optimal layout is rectangular pieces of a NPC problem, in the industrial sector has a wide range of applications. For this problem, an adaptive simulated annealing genetic algorithm. Using a ring-based crossover operator and mutation operator ring adaptive genetic algorithm to automatically adjust the crossover and mutation and introduce simulated annealing is greater than the average fitness of the individual fitness of individuals annealing. Adaptive simulated annealing genetic algorithm fully adaptive genetic algorithm and simulated annealing their global search capability and local search capabilities. Comparative experiments show that the algorithm is left with the most improved layout algorithm to solve the most under the optimal nesting rectangular pieces of the problem more effectively.
Date : 2026-01-02 Size : 460kb User : 木易
[AI-NN-PR] dpso DL : 0: 离散微粒群优化算法解决流水线调度问题。包含多个有名算法：NEH，局部搜索算法等。-Discrete Particle Swarm Optimization algorithm to solve assembly line scheduling problem. Contains several well-known algorithms: NEH, local search algorithm.
Date : 2026-01-02 Size : 3kb User : zhangfengrong
[AI-NN-PR] simulated-anealing DL : 0: 模拟退火算法是局部搜索算法的扩展，以一定的概率选择领域中费用值大的状态-Simulated annealing algorithm is an extension of local search algorithm to choose a certain probability value of large areas of the state fee
Date : 2026-01-02 Size : 2kb User : 周同同
[AI-NN-PR] Dynamic-Search-Algorithm DL : 0: 提出一种基于改进粒子群动态搜索算法的网络重构方法，算法把初始粒子群按照适应度的大小分为两个互不交叉，且具有不同分工的子群，并进行动态搜索。通过引入了交叉和禁忌思想，减少了解陷入局部最优的可能性．与遗传、禁忌搜索算法重构的结果进行比较，表明本文算法具有更高的搜索效率，更容易找到全局最优解．-：An improved method based on improved particle swarm optimization dynamic search algodthm networkrcconfiguration is presented in this paper．The initial particle swarm is divided into two different subgroups according to the size of fitness，with a division of labour between the different subgroups of dynamic search．Cross thinking and ideological tabu ale ledinto this algorithm to reduce the possibility of local Optimum．Compared with genetic and tabu search algorithm,the results show that the proposed method possesses a hi．gher search efficiency andis easier tO find the global optimum solutions．
Date : 2026-01-02 Size : 410kb User : yirufang
[AI-NN-PR] NQueens DL : 0: nqueens 问题的QS1实现 N-皇后问题的快速局部搜索算法 1分钟可以找到75000皇后的一个解参考：Rok Sosic and Jun Gu. A Polynomial Time Algorithm for the N-Queens Problem. SIGART Bulletin, 1(3):7-11, 1990.-Fast Local Search Algorithm QS1 nqueens problem realization // // N- Queens problem Reference: Rok Sosic and Jun Gu A Polynomial Time Algorithm for the N-Queens Problem SIGART Bulletin, 1 (3):.. 7-11, 1990 .
Date : 2026-01-02 Size : 334kb User : typ
[AI-NN-PR] beibao DL : 0: 模拟退火算法是一种通用的随机搜索算法，是对局部搜索算法的扩展。与一般局部搜索算法不同，SA以一定的概率选择领域中目标值相对较小的状态，是一种理论上的全局最优算法。-Simulated annealing algorithm is a common random search algorithm is an extension of local search algorithm. Different general local search algorithm, SA with a certain probability target areas selected in a relatively small state, is a theoretical global optimal algorithm.
Date : 2026-01-02 Size : 1kb User : charle007
[AI-NN-PR] FOA-algorithm- DL : 0: FOA是一种较新的只能算法，该算法具有较强的搜索能力，局部搜索能力较强，在连续问题和离散问题上都有很多的应用-FOA is a newer only algorithm, the algorithm has a strong search ability, strong local search ability, continuous problems and discrete problems have a lot of applications
Date : 2026-01-02 Size : 15.44mb User : guan

« 12 »