Location:
Search - heuristic TSP
Search list
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.
Platform: |
Size: 4853791 |
Author: 陈宝文 |
Hits:
Description: 旅行商问题的遗传算法求解源代码，多目标优化经典问题的现代启发式算法实现-traveling salesman problem genetic algorithm source code, multi-objective optimization of the modern classic Heuristic Algorithm
Platform: |
Size: 4096 |
Author: 鸿渐 |
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: java编写的最短路径算法，先由启发式方法获得染色体的初始编码，然后由遗传算法求出最短路径，对解决物流领域的TSP是非常好的计算机实现-java prepared by the shortest path algorithm, by the heuristic method to obtain the initial encoding of chromosome, and then by the genetic algorithm to derive the shortest path to solve the TSP area of logistics is a very good computer
Platform: |
Size: 312320 |
Author: wangxiaofang |
Hits:
Description: Lin-Kernighan heuristic for the TSP and minimum weight perfect matching
Platform: |
Size: 1797120 |
Author: foxman |
Hits:
Description: 实现了蚁群算法求解TSP问题。注释详细
function[R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q)
-------------------------------------------------------------------------
主要符号说明
C n个城市的坐标，n×2的矩阵
NC_max最大迭代次数
m蚂蚁个数
Alpha表征信息素重要程度的参数
Beta表征启发式因子重要程度的参数
Rho信息素蒸发系数
Q信息素增加强度系数
R_best各代最佳路线
L_best各代最佳路线的长度
=========================================================================
-Ant Colony Algorithm for the realization of the TSP problem. Notes the detailed function [R_best, L_best, L_ave, Shortest_Route, Shortest_Length] = ACATSP (C, NC_max, m, Alpha, Beta, Rho, Q) ------------------------------------------------------------------- The main symbol------ C n that cities coordinates, n × 2 matrix NC_max the largest number of iterations m the number of Alpha ant pheromones characterized the importance of the parameters Beta factor heuristic importance of characterization of the parameters Rho evaporation coefficient of pheromone pheromone Q increase in intensity coefficient R_best best route generations generations L_best the length of the best route ====== ================================================== =================
Platform: |
Size: 2048 |
Author: 王晶 |
Hits:
Description: tsp问题的群蚁算法实现，其中c为测试矩阵，代表各点的相对坐标，NC_max 最大迭代次数
，m蚂蚁个数，Alpha 表征信息素重要程度的参数，Beta 表征启发式因子重要程度的参数，Rho 信息素蒸发系数，Q 信息素增加强度系数，R_best 各代最佳路线，L_best 各代最佳路线的长度，运行后得到最佳路线和收敛曲线-ant problem tsp algorithm group, of which c for the test matrix, the representative of the relative coordinates of the points, NC_max the largest number of iterations, m the number of ants, Alpha pheromone characterization of the importance of the parameters, Beta factor, the importance of heuristic characterization of the parameters , Rho pheromone evaporation factor, Q factor pheromone to increase strength, R_best generations the best route, L_best generations the best route length, running the best routes and the convergence curve
Platform: |
Size: 1024 |
Author: WJC |
Hits:
Description: TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. Tabu Search is a heuristic that prevent the process from cycling in a small set of solutions, some attribute of recently visited solutions is stored in a Tabu List, which prevents their occurrence for a limited period. For our problem, the attribute used is a pair of nodes that have been exchanged recently. A Tabu structure stores the number of iterations for which a given pair of nodes is prohibited from exchange.
Platform: |
Size: 17408 |
Author: amilcar |
Hits:
Description: 禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期和长期禁忌列表存储器来保证算法能搜索到全和分局空间的每一点, 并且不重复搜索。经过验算析, 证明它是一种较好的全局启发式搜索法.-Tabu search method, the initial solution, neighborhood and tabu list size of the number of parameters such as have more stringent requirements, these parameters directly affect the ability to optimize the algorithm. This paper presents an improved tabu search method, it is used effectively to compress the search space, so that can improve search efficiency and global search capabilities. Short-term and long-term memory tabu list to ensure the algorithm can search the whole and the sub-space, each point, and do not repeat the search. After checking analysis to prove that it is a good global heuristic search method.
Platform: |
Size: 475136 |
Author: logspace |
Hits:
Description: 禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能
力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期
和长期禁忌列表存储器来保证算法能搜索到全局空间的每一点, 并且不重复搜索。经过验算和分析, 证明它是一种较好的
全局启发式搜索法-Tabu search method, the initial solution, neighborhood and tabu list size of the number of parameters such as have more stringent requirements, these parameters directly affect the ability to optimize the algorithm. This paper presents an improved tabu search method, it is used effectively to compress the search space, so that can improve search efficiency and global search capabilities. Short-term and long-term memory tabu list to ensure the algorithm to search to the global space, each point, and do not repeat the search. After checking and analysis, to prove that it is a good global heuristic search method
Platform: |
Size: 2048 |
Author: logspace |
Hits:
Description: 用A* 算法计算人工智能方面的旅行商问题 称为TSP问题 也可以称用启发式解决TSP问题-A* algorithm using artificial intelligence known as the traveling salesman problem TSP problem can also be known as heuristic problem solving TSP
Platform: |
Size: 2048 |
Author: 神马 |
Hits:
Description: Lin-Kernighan heuristic for the TSP
Platform: |
Size: 1859584 |
Author: Tom |
Hits:
Description: TSP Travelling Salesman Problem Heuristic. We included the MST-Heuristik (Minimum Spaning Tree) as well as the Christofides-Heuristik. Both solve the TSP Problem.
Platform: |
Size: 2048 |
Author: Testy Tum |
Hits:
Description: Another version of TSP Travelling Salesman Problem Heuristic. We included the MST-Heuristik (Minimum Spaning Tree) as well as the Christofides-Heuristik. Both solve the TSP Problem.
Platform: |
Size: 2048 |
Author: Testy Tum |
Hits:
Description: TSP问题是一个典型的、容易描述但是难以处理的NP完全问题，同时TSP问题也是诸多领域内出现的多种复杂问题的集中概括和简化形式。目前求解TSP问题的主要方法有启发式搜索法、模拟退火算法、遗传算法、Hopfield神经网络算法、二叉树描述算法。所以，有效解决TSP问题在计算理论上和实际应用上都有很高的价值，而且TSP问题由于其典型性已经成为各种启发式的搜索、优化算法的间接比较标准(如遗传算法、神经网络优化、列表寻优(TABU)法、模拟退火法等)。遗传算法就其本质来说，主要是解决复杂问题的一种鲁棒性强的启发式随机搜索算法。因此遗传算法在TSP问题求解方面的应用研究，对于构造合适的遗传算法框架、建立有效的遗传操作以及有效地解决TSP问题等有着多方面的重要意义。-The TSP The problem is a typical, easy to describe but difficult to handle the NP-complete problem, the TSP many areas centralized summarized and simplified form of a variety of complex issues. The main method of solving TSP heuristic search method, simulated annealing, genetic algorithm, Hopfield neural network algorithm, the binary tree to describe the algorithm. Therefore, an effective solution to the TSP has a very high value in the calculation of the theoretical and practical applications, and TSP problem has become due to its typical variety of heuristic search, optimization of indirect comparison standard (such as genetic algorithms, neural networks optimization list optimization (TABU), simulated annealing, etc.). The genetic algorithm is by its very nature, a robustness to solve complex problems heuristic random search algorithm. Genetic algorithm TSP problem solving aspects of applied research, genetic algorithm framework for constructing a suitable, effective genetic manipul
Platform: |
Size: 1280000 |
Author: 孟晓龙 |
Hits:
Description: TSP是组合优化问题的经典问题，作为启发式算法的编程初学者可以利用这个问题练习编程，本算例条理清晰，简单明了，可以进行学习。-TSP problem is a classic combinatorial optimization problems, as heuristic programming beginner exercise program can take advantage of this issue, this study clear, simple, can learn.
Platform: |
Size: 2048 |
Author: 葛显龙 |
Hits:
Description: Simulated Annealing (SA) is the oldest probabilistic
meta-heuristic algorithm and one of the first algorithms
having ability to avoid being trapped in local minima. It
is inspired by the process of annealing in metallurgy. In
this process a material is heated and slowly cooled into
solid crystal state with minimum energy and larger
crystal size to reduce defects in metallic structures. Once
the system has cooled, the configuration will represent a
sample at or close to a global optimum.
Platform: |
Size: 2048 |
Author: sorayya |
Hits:
Description: Heuristic method for the Traveling Salesman Problem
A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.
function tspplot(p,X,nodenum) #ok
TSPPLOT Plot 2D tour
TSPPLOT(P,X), P is the tour and X is the coordinate matrix
TSPPLOT(P,X,1) also adds node numbers-Heuristic method for the Traveling Salesman Problem
A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.
function tspplot(p,X,nodenum) #ok
TSPPLOT Plot 2D tour
TSPPLOT(P,X), P is the tour and X is the coordinate matrix
TSPPLOT(P,X,1) also adds node numbers
Platform: |
Size: 2048 |
Author: ahmed |
Hits:
Description: 启发式算法的TSP的matlab程序，包含模拟退火算法与遗传算法。(Heuristic algorithm of TSP matlab program, including simulated annealing algorithm and genetic algorithm.)
Platform: |
Size: 1843200 |
Author: canlee1992
|
Hits:
Description: 用于解决TSP的启发式算法的matlab程序，包含模拟退火算法与遗传算法。(Matlab program for solving TSP heuristic algorithm, including simulated annealing algorithm and genetic algorithm.)
Platform: |
Size: 82944 |
Author: canlee1992
|
Hits: