Search - Traveling Salesman parallel

Search - Traveling Salesman parallel - List

[Other resource] AntColonySystemCooperativeLearningApproachtotheTra DL : 0: 英文资料。利用蚁群算法正反馈、并行计算的优点，将蚁群算法用于求解典型的NP-hard问题—旅行商问题。-English. Ant algorithm is the use of feedback, the advantages of parallel computing, Ant algorithm will be used to solve the typical NP-hard problem-Traveling Salesman Problem.
Update : 2008-10-13 Size : 293.07kb Publisher : safin
[Windows Develop] 演化法 DL : 0: 首先介绍了当前求解TSP问题最好的演化算法之一：GT算法。文中重点设计了在NOW上求解旅行商问题GT算法的并行算法，详细描述了设计思路，设计策略。还给出了相当详细的并行算法描述。文中设计的并行算法已经在NOW上的PVM平台上实现。关键词NOW，演化计算，旅行商问题,并行计算-first briefed on the current TSP evolutionary algorithm best one : GT algorithm. The article focused on the design of the NOW on solving the traveling salesman problem GT algorithm parallel algorithm, described in detail the design concept, design strategy. Also given a fairly detailed description of the parallel algorithm. The text of parallel algorithm design in NOW's PVM achieve. Keywords NOW, evolutionary computation, the traveling salesman problem, parallel computing
Update : 2025-02-17 Size : 195kb Publisher : 巨金华
[Other] AntColonySystemCooperativeLearningApproachtotheTra DL : 0: 英文资料。利用蚁群算法正反馈、并行计算的优点，将蚁群算法用于求解典型的NP-hard问题—旅行商问题。-English. Ant algorithm is the use of feedback, the advantages of parallel computing, Ant algorithm will be used to solve the typical NP-hard problem-Traveling Salesman Problem.
Update : 2025-02-17 Size : 293kb Publisher : safin
[MPI] MPI_C_TSP DL : 0: 在MPI平台下，用C语言实现模拟退火算法的货郎担问题的并行算法。-In the MPI platform, using C language to achieve simulated annealing algorithm traveling salesman problem of the parallel algorithm.
Update : 2025-02-17 Size : 8kb Publisher : 俊峰
[MPI] multisp DL : 0: 使用MPI编写一个并行程序，利用遗传算法来解决旅行商问题。-The use of MPI to prepare a parallel process, the use of genetic algorithm to solve the traveling salesman problem.
Update : 2025-02-17 Size : 52kb Publisher : pim
[AI-NN-PR] GA DL : 0: 介绍遗传算法基本原理和人工神经网络,并行遗传,遗传程序等,并用这些方法为商旅问题等求解-Genetic algorithm and Artificial neural network Parallel GA Genetic programming Traveling salesman
Update : 2025-02-17 Size : 132kb Publisher : 张庭
[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.
Update : 2025-02-17 Size : 2kb Publisher : 咋都有
[Other] Parallel-genetic-algorithm DL : 0: 经典遗传算法利用单一种群对种群个体进行交叉、变异和选择操作，在进化过程中的超级个体易产生过早收敛现象，粗粒度并行遗传算法利用多个子种群进行进化计算，各子群体分别独立进行遗传操作，相互交换最优个体后继续进化。该文证明了该算法的搜索过程是一个有限时齐遍历马尔柯夫链，给出粗粒度并行遗传算法全局最优收敛性证明。对于旅行商问题TSP利用粗粒度并行遗传算法进行了求解，以解决经典遗传算法的收敛到局部最优值问题。仿真结果表明，算法的收敛性能优于经典遗传算法。-Classic genetic algorithm using a single population of individuals in a population cross, mutation and selection operation, the super individuals in the evolutionary process is easy to produce premature convergence phenomenon, coarse-grained parallel genetic algorithm using multiple sub-populations of evolutionary computation, various sub-groups, respectively, independent The genetic manipulation, the exchange of best individual continue to evolve. This paper shows that the search process of the algorithm is a finite homogeneous traverse the Markov chain, given the coarse-grained parallel genetic algorithm global optimal convergence proof. For the traveling salesman problem TSP coarse-grained parallel genetic algorithm to solve to solve the classic genetic algorithm converges to a local optimum value. The simulation results show that the convergence of the algorithm is superior to the classical genetic algorithm.
Update : 2025-02-17 Size : 910kb Publisher : 陈嘉鑫
[Process-Thread] tsp_bingxing DL : 0: 旅行商问题的多线程编程，可以缩短处理时间，实现并行加速-Traveling Salesman Problem multithreaded programming, you can shorten the processing time, to achieve parallel speedup
Update : 2025-02-17 Size : 499kb Publisher : wanghui
[Software Engineering] parallel-memetic DL : 0: parallel memetic traveling salesman problem
Update : 2025-02-17 Size : 151kb Publisher : sajad
[MPI] MPI_Distributed_Genetic_Algorithm-master DL : 0: For this project I implemented a parallel formulation for the Traveling Salesman Problem (TSP). The TSP is a NP-hard problem in combinatorial optimization. Given a list of cities with their pairwise distance, the task is to find the shortest route that visits all the cities once and returns to the origin city. The problem was formulated in 1930 and is one of the most intensively studied problems in optimization with applications in planning, logistics, and the manufacturing of micro-chips.
Update : 2025-02-17 Size : 26kb Publisher : udin