CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - heuristic TSP
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
Compress-Decompress algrithms
STL
Data structs
Algorithm
AI-NN-PR
matlab
Bio-Recognize
Crypt_Decrypt algrithms
mathematica
Maple
DataMining
Big Data
comsol
physical calculation
chemical calculation
simulation modeling
Search - heuristic TSP - List
[
AI-NN-PR
]
TSPGACCODE
DL : 0
旅行商问题的遗传算法求解源代码,多目标优化经典问题的现代启发式算法实现-traveling salesman problem genetic algorithm source code, multi-objective optimization of the modern classic Heuristic Algorithm
Date
: 2025-12-22
Size
: 4kb
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
: 2025-12-22
Size
: 100kb
User
:
文龙
[
AI-NN-PR
]
lk-0.5.0.tar
DL : 0
Lin-Kernighan heuristic for the TSP and minimum weight perfect matching
Date
: 2025-12-22
Size
: 1.71mb
User
:
foxman
[
AI-NN-PR
]
ACOforTSP
DL : 0
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
Date
: 2025-12-22
Size
: 1kb
User
:
WJC
[
AI-NN-PR
]
tabu
DL : 0
禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期和长期禁忌列表存储器来保证算法能搜索到全和分局空间的每一点, 并且不重复搜索。经过验算析, 证明它是一种较好的全局启发式搜索法.-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.
Date
: 2025-12-22
Size
: 464kb
User
:
logspace
[
AI-NN-PR
]
TSP
DL : 0
用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
Date
: 2025-12-22
Size
: 2kb
User
:
神马
[
AI-NN-PR
]
ant
DL : 0
蚁群算法(ant colony algorithm,简称ACA)是20世纪90年代由意大利学者M.Dorigo等人首先提出来的一种新型的模拟进化算法.它的出现为解决NP一难问题提供了一条新的途径.用蚁群算法求解旅行商问题(TSP)、分配问题(QAP)、调度问题(JSP)等,取得了一系列较好的实验结果.虽然对蚁群算法研究的时间不长,但是初步研究已显示出蚁群算法在求解复杂优化问题(特别是离散优化问题)方面具有一定的优势,表明它是一种很有发展前景的方法.蚁群算法的主要特点是:正反馈、分布式计算.正反馈过程使它能较快地发现问题的较好解;分布式易于并行实现,将它与启发式算法相结合,易于发现较好解.-ACO (ant colony algorithm, referred to as ACA) is the 1990s by the Italian scholar M. Dorigo, who first proposed a new type of simulated evolutionary algorithm. It appears to solve NP-hard problem provides a new way. Ant colony algorithm for traveling salesman problem (TSP), distribution (QAP), scheduling problems (JSP), etc., made a series of good results. Although the ant colony algorithm is not long, but preliminary studies have shown that the ant colony algorithm in solving complex optimization problems (in particular, discrete optimization problem) has certain advantages, that it is a promising approach. The main features of ant colony algorithm is: positive feedback, distributed computing. Positive feedback process so that it can quickly find a better solution of the problem distributed easy-to-parallel implementation, it would be combined with the heuristic algorithm, easy to find better solutions.
Date
: 2025-12-22
Size
: 2kb
User
:
咋都有
[
AI-NN-PR
]
TSP
DL : 0
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
Date
: 2025-12-22
Size
: 1.22mb
User
:
孟晓龙
[
AI-NN-PR
]
ANT_TSP
DL : 1
基本蚁群算法,介绍了种群产生,信息素的更新以及启发式信息的定义。测试例子为TSP问题。-Ant colony algorithm, introduced populations produce, update, and define the heuristic information pheromone. Test case for the TSP problem.
Date
: 2025-12-22
Size
: 2kb
User
:
xuqi
[
AI-NN-PR
]
MatLab-Script
DL : 0
基于启发式(Heuristic)的人工智能算法解决旅行商问题(Traveling Salesman Problem)。关键词:模拟退火,遗传算法。工作环境:matlab-An artificial intelligence algorithm based on heuristic to solve Traveling Salesman Problem(TSP). Key words: Simulated Annealing, Genetic Algorithm. Working environment: matlab.
Date
: 2025-12-22
Size
: 1.75mb
User
:
TerryYan
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.