登录
首页 » matlab » ga-for-tsp

ga-for-tsp

于 2008-11-12 发布 文件大小:3KB
0 194
下载积分: 1 下载次数: 0

代码说明:

说明:  利用遗传算法解决50个城市tsp问题,适合初学者。(The use of genetic algorithm to solve the issue of 50 cities tsp, suitable for beginners.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Boston
    travel guide to boston
    2010-11-01 15:50:27下载
    积分:1
  • ga-tool2
    基于matlab的关于遗传算法的一些重要的函数的m文件,供读者参考 (Based on some of the important matlab m file on genetic algorithm function for readers reference)
    2013-12-23 14:17:26下载
    积分:1
  • KPMtools
    Matlab工具包补充算发,包括各种噪声代码及滤波倒向Smoother代码等(Matlab toolkit added fat count, including all kinds of noise code and filter code, such as backward Smoother)
    2007-12-04 15:57:07下载
    积分:1
  • Applications-of-the-layer-KKR-method
    Layer KRR method document
    2013-02-24 08:37:16下载
    积分:1
  • yiqunsuanfa1
    能够实现蚁群算法寻优的程序,可以直接运行,运行后出来收敛图(Ant colony optimization algorithm can achieve a program that can be run directly after running out of the convergence plan)
    2020-10-08 14:47:38下载
    积分:1
  • New-folder
    基于Li Xu论文的前两部分代码,包括Stroke和Tone Mapping (The Matlab code works for the algorithm proposed in the paper Combining Sketch and Tone for Pencil Drawing Production)
    2015-04-15 23:05:55下载
    积分:1
  • 0-1programming
    0-1整数规划有很广泛的应用背景,比如指派问题,背包问题等等,实际上TSP问题也是一个0-1问题,当然这些问题都是NP问题,对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的,本程序只不过是一个练习,得意之处是用递归法把所有解都排列出来。另:胡运权所著的《运筹学基础及应用(第三版)》第97页的例3,我用本程序求解得到的结果是:最优解是x*=(1,0, 0, 0, 0),最优值是f(x*)=8,但书求得最优解是x*=(1,0, 1, 0, 0),最优值是f(x*)=4,是不是书中写错了,请大家验证。以下是源程序,大家可以任意使用无版权问题,另外,如果大家有大规模的0-1规划的问题也希望提供给我,谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)
    2006-07-01 10:33:18下载
    积分:1
  • ofdm
    介绍了ofdm的原理,发展历史,关键技术等内容(Describes the principles of ofdm, development history, key technologies, etc.)
    2013-07-27 10:47:30下载
    积分:1
  • 工作空间
    说明:  用于计算Delta机器人在三维空间中的工作区域(Calculating the Working Area of Delta Robot in Three-Dimensional Space)
    2018-12-27 17:29:06下载
    积分:1
  • threephaseinverter
    simulation of three phase inverter
    2009-11-15 01:37:06下载
    积分:1
  • 696518资源总数
  • 106155会员总数
  • 8今日下载