Location:
Search - ga traveling
Search list
Description: C#版遗传算法解TSP问题-C# version Genetic Algorithm for the Traveling Salesman Problem
Platform: |
Size: 8545 |
Author: 黄瑞 |
Hits:
Description: MATLAB版遗传算法解TSP问题-MATLAB version Genetic Algorithm for the Traveling Salesman Problem
Platform: |
Size: 1876 |
Author: 黄瑞 |
Hits:
Description: C#版遗传算法解TSP问题-C# version Genetic Algorithm for the Traveling Salesman Problem
Platform: |
Size: 8192 |
Author: 黄瑞 |
Hits:
Description: 遗传算法解决TSP问题的VC＋＋实现（附带地图）-Genetic Algorithm for the Traveling Salesman Problem VC++ (with map)
Platform: |
Size: 1697792 |
Author: ntlizheng |
Hits:
Description: this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value -this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter, value
Platform: |
Size: 4096 |
Author: 宏姬 |
Hits:
Description: 用遗传算法求解TSP（旅行商）问题，按照TSP1.m中的格式输入程序参数即可。-Genetic Algorithm with TSP (traveling salesman) problems, in accordance with the format in TSP1.m parameter entry process.
Platform: |
Size: 4096 |
Author: 王元 |
Hits:
Description: 基于遗传算法解决旅行商问题的vc++源码。-Based on genetic algorithm to solve the traveling salesman problem vc++ Source.
Platform: |
Size: 391168 |
Author: wangjing |
Hits:
Description: 遗传算法解中国旅行商问题，里面有45个城市，用遗传算法算出近似最优解-Genetic Algorithm for Traveling Salesman Problem in China, there are 45 cities, using genetic algorithms calculate the approximate optimal solution
Platform: |
Size: 520192 |
Author: lsk |
Hits:
Description: 此源代码是用遗传算法解决旅行商问题的经典实例，很有借鉴意义-This source code is a genetic algorithm to solve the classic traveling salesman problem instances of referential significance to
Platform: |
Size: 4096 |
Author: 张媛 |
Hits:
Description: 采用遗传算法解决ＴＳＰ旅行商问题
对初学遗传算法者很不错-The use of genetic algorithm to solve traveling salesman problem TSP to the beginner who is pretty good genetic algorithm
Platform: |
Size: 4096 |
Author: 肖玲俐 |
Hits:
Description: vs2005开发
遗传算法求解144城市的旅行商问题-VS2005 to develop genetic algorithm 144 city traveling salesman problem
Platform: |
Size: 460800 |
Author: 庄雄雄 |
Hits:
Description: 遗传算法解旅行商问题 （工程须运行在VS2008下）-Genetic Algorithm for Traveling Salesman Problem [Works have to run in VS2008 under]
Platform: |
Size: 22528 |
Author: sunset |
Hits:
Description: 介绍遗传算法基本原理和人工神经网络,并行遗传,遗传程序等,并用这些方法为商旅问题等求解-Genetic algorithm and Artificial neural network
Parallel GA
Genetic programming
Traveling salesman
Platform: |
Size: 135168 |
Author: 张庭 |
Hits:
Description: Genetic Algorithm (GA) based solver for the Traveling Salesman Problem
Platform: |
Size: 20480 |
Author: foxman |
Hits:
Description:
This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link robot arm. The objective function for the proposed GA is to minimizing traveling time and space, while not exceeding a maximum
pre-defined torque, without collision with any obstacle in the robot workspace. -
This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link robot arm. The objective function for the proposed GA is to minimizing traveling time and space, while not exceeding a maximum
pre-defined torque, without collision with any obstacle in the robot workspace.
Platform: |
Size: 1364992 |
Author: guigui |
Hits:
Description: 多旅行商问题(Multiple Traveling Salesperson Problem ,简称MTSP) 讨论的是如何安排m( > 1 ) 位旅行商访问n( >
m ) 座城市,要求每个城市只允许被访问一次时,求解所有旅行商花费的费用和是最小(或最大) 的问题。MTSP 问题其实与单
旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条
件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。现
为解决MTSP 问题给出了一种新的染色体设计和相关的处理方法,并与以往的理论设计和计算性能进行比较。计算测试显
示,新的方法能够获得较小的查找空间,在许多方面,新的方法产生的解空间更好。-Multi-Traveling Salesman Problem (Multiple Traveling Salesperson Problem, referred to as MTSP) discussed the arrangements for the m (> 1)-bit traveling salesman visits n (>
m) cities to require each city to allow only visited once, the solution of traveling salesman to spend all the costs and the smallest (or largest) problems. In fact, with the single issue of MTSP
TSP (Traveling Salesperson Problem, referred to as TSP) is similar to, but added any city as long as the visit by a traveling salesman to be attached to the
Pieces, thus increasing the complexity of the problem. The use of genetic algorithms in the past (GA) to study and solve the issue of MTSP, usually a standard chromosome and the TSP approach. Is
MTSP problem to solve is given a new design and associated chromosome approach and the theory of the previous design and to compare performance. Calculation of the test significantly
Show that the new method can find a smaller space, in many respects, the new met
Platform: |
Size: 247808 |
Author: liqiubin |
Hits:
Description: 遗传算法求解TSP问题的MATLAB实现。这是一篇非常有新意的论文，对于学习遗传算法非常有用-This paper has resolved the traveling salesman problem(TSP) by virtue of geneitc algorithms(GA)
Platform: |
Size: 156672 |
Author: 王斌 |
Hits:
Description: MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to the M-TSP by setting up a GA to search
for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations)
Platform: |
Size: 4096 |
Author: gao |
Hits:
Description: GA_Traffic
The Traveling Salesman Problem (TSP) is maybe the archetypical problem
in combinatorial optimization. This problem and its generalizations, vehicle
routing problems, have been studied for more than thirty years two entire
monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard,
polynomial-time approximation algorithms are usually studied. However,
usually the approaches to the study of vehicle routing problems adopt an
offline point of view: the input is entirely known beforehand. In many
applications, this is actually not the case since the instance becomes known
in an online fashion, time after time. Even determining when the instance
is completely given could be impossible. The need for an online model then
arises naturally.-GA_Traffic
The Traveling Salesman Problem (TSP) is maybe the archetypical problem
in combinatorial optimization. This problem and its generalizations, vehicle
routing problems, have been studied for more than thirty years two entire
monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard,
polynomial-time approximation algorithms are usually studied. However,
usually the approaches to the study of vehicle routing problems adopt an
offline point of view: the input is entirely known beforehand. In many
applications, this is actually not the case since the instance becomes known
in an online fashion, time after time. Even determining when the instance
is completely given could be impossible. The need for an online model then
arises naturally.
Platform: |
Size: 1024 |
Author: gardenia_roses |
Hits:
Description: 使用遗传算法解决了旅行商问题，采用C++做实现(The traveling salesman problem is solved by genetic algorithm, and implemented by C++.)
Platform: |
Size: 2048 |
Author: derek__z |
Hits: