Location:
Search - local search
Search list
Description: Local search. Algorithm that explores the space of possible solutions in sequential fashion, moving from a current solution to a \"nearby\" one.
Neighbor relation. Let S S be a neighbor relation for the problem.
Gradient descent. Let S denote current solution. If there is a neighbor S of S with strictly lower cost, replace S with the neighbor whose cost is as small as possible. Otherwise, terminate the algorithm
Platform: |
Size: 209479 |
Author: supercat188 |
Hits:
Description: TSP算法，应用局部搜索法得到最优路径，已经经过优化。没有密码，可以使用，vc环境下使用。-TSP algorithm, using local search to be optimal path has been optimized. No password can be used, vc environments.
Platform: |
Size: 1357824 |
Author: 霍哲 |
Hits:
Description: RBFS算法（递归最佳优先搜索：A*家族）和LRTA*算法（联机局部搜索，又名实时学习A*搜索，同为A*家族）实现图的单源最短路径。其中RBFS和LRTA*算法均比狄杰算法效率高！
-RBFS algorithm (recursive best first search :* A family) and the LRTA* algorithm (online local search, also known as real-time learning A* search, with the A* family) plans to achieve a single source shortest path. Which RBFS and LRTA* Algorithm than Dilger efficient algorithm!
Platform: |
Size: 19456 |
Author: 陈名 |
Hits:
Description: 单纯形法是一种不错的随机搜索算法，但是其受初始值的选取，步长大小的影响较大，容易陷入局部收敛。程序中列出了基本单纯形法，和几种改进的单纯形法，包括变步长的单纯形法，单纯形加遗传算法等。-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.
Platform: |
Size: 59392 |
Author: xcq |
Hits:
Description: java本地文件搜索,功能较简单,实现思想也较简单-java local file search function relatively simple, the realization of ideas than a simple
Platform: |
Size: 199680 |
Author: fire |
Hits:
Description: 局部搜索法求解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.
Platform: |
Size: 1024 |
Author: 清和信平 |
Hits:
Description: 高效的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++.
Platform: |
Size: 907264 |
Author: 陈明 |
Hits:
Description: 应用遗传算法是被认为求解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.
Platform: |
Size: 7168 |
Author: 王博文 |
Hits:
Description: Local search. Algorithm that explores the space of possible solutions in sequential fashion, moving from a current solution to a "nearby" one.
Neighbor relation. Let S S be a neighbor relation for the problem.
Gradient descent. Let S denote current solution. If there is a neighbor S of S with strictly lower cost, replace S with the neighbor whose cost is as small as possible. Otherwise, terminate the algorithm-Local search. Algorithm that explores the space of possible solutions in sequential fashion, moving from a current solution to a nearby one.Neighbor relation. Let S
Platform: |
Size: 208896 |
Author: supercat188 |
Hits:
Description: 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.
Platform: |
Size: 102400 |
Author: 文龙 |
Hits:
Description: 在运行本程序时，检索整个局域网络，将局域网中的计算机名和IP地址显示在ListControl空间中。-Running the program, search the entire local area network LAN of the computer name and IP address appears in ListControl space.
Platform: |
Size: 27648 |
Author: 李明 |
Hits:
Description: A Genetic Algorithm Hybridized with Local Search Operator
Platform: |
Size: 104448 |
Author: xig |
Hits:
Description: 与禁忌搜索动态修改邻域结构的方法不同, GLS的基本原则是通过不断改变搜索空间的地形(landscape)来帮助搜索过程逐步移出局部极值的, 也就是说搜索过程中解结构和邻域结构将保持不变, 而目标函数将被动态修改, 以使得当前的局部极值不再具有局部最优性。-Guided Local Search sits on top of local search heuristics and has as a main aim to guide these procedures in exploring efficiently and effectively the vast search spaces of combinatorial optimization problems.
Platform: |
Size: 780288 |
Author: columbia |
Hits:
Description: 模拟退火和对称
*欧几里德旅行商问题。
*
*为基础的解决办法的本地搜索启发式
*非过境道路和近邻
-/*
* Simulated annealing and the Symetric
* Euclidian Traveling Salesman Problem.
*
* Solution based on local search heuristics for
* non-crossing paths and nearest neighbors
*
* Storage Requirements: n^2+4n ints
*
* Problem: given the coordinates of n cities in the plane, find a
* permutation pi_1, pi_2, ..., pi_n of 1, 2, ..., n that minimizes
* sum for 1<=i<n D(pi_i,pi_i+1), where D(i,j) is the euclidian
* distance between cities i and j
*
* Note: with n cities, there is (n-1)!/2 possible tours.
* factorial(10)=3628800 factorial(50)=3E+64 factorial(150)=5.7E+262
* If we could check one tour per clock cycle on a 100 MHZ computer, we
* would still need to wait approximately 10^236 times the age of the
* universe to explore all tours for 150 cities.
*
* gcc-O4-o tsp tsp.c-lm tsp | ghostview-
*
* Usage: tsp [-v] [n=dd] [s=dd] [filename]
* -v : verbose
* n= : nb of cities (cities generated randomly on E^2
Platform: |
Size: 86016 |
Author: 孙博 |
Hits:
Description: Best-first search
Greedy best-first search
A* search
Heuristics
Local search algorithms
Hill-climbing search
Simulated annealing search
Local beam search
Genetic algorithms
Platform: |
Size: 267264 |
Author: it |
Hits:
Description: 这个程序采用局部搜索算法（Local Search），速度很快，
在配置为奔腾200，内存64MB,上测试可以在
几秒钟内解一百万阶的皇后问题。-This procedure using a local search algorithm (Local Search), fast, in the configuration for the Pentium 200, RAM 64MB, the test solution in a few seconds of order 1 million queens problem.
Platform: |
Size: 1024 |
Author: spencer |
Hits:
Description: It is Local search 8qween problem
Platform: |
Size: 1024 |
Author: Feroj |
Hits:
Description: 实现局部寻找最大值点，通过Matlab软件实现-Local search for maximum points achieved by Matlab software
Platform: |
Size: 5120 |
Author: 衣鹏 |
Hits:
Description: this is a pdf file for solving complex optimization problems by local search
Platform: |
Size: 815104 |
Author: annu |
Hits:
Description: GRASP (greedy randomized adaptive search Procedure) is an algorithm commonly applied to problems of combinatorial optimization. As various construction methods, the application of grasp is to create an initial solution and then perform a local search to improve the quality of the solution. Your differential to other methods is the generation of initial solution, based on the first three stages of its acronym in English: greedy (Greedy), random (trial) and adaptive (Adaptive).
Platform: |
Size: 1024 |
Author: wesleymagasat
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
29
»