Description: GA（Simple Genetic Algorithm）是一种强大的智能多变量优化算法，它模仿种群繁殖规律来进行优化。
本SGA可以优化变量，求最小值,最大值（当把函数倒数也就求最小值啦）
并且支持浮点编码，grey编码，二进制编码；轮赌法选择，锦标赛选择；单点交叉，均布交叉，浮点交叉；单点变异，浮点变异；-GA (Simple Genetic Algorithm) is a powerful, intelligent multi-variable optimization algorithms, which mimic the breeding populations of the law to be optimized. SGA can optimize this variable, and the minimum value, maximum value (when the function of the countdown you will seek the minimum value) and to support the floating-point encoding, grey code, binary code round of gambling options, tournament selection single-point crossover, uniform Cross, floating-point crossover single point mutation, floating-point variation Platform: |
Size: 9216 |
Author:yuandi |
Hits:
Description: 可行点标记求最佳匹配算法的MATLAB 程序代码 求最小费用最大流算法的MATLAB 程序代码 匈牙利算法的MATLAB 程序代码 遗传算法解决TSP问题的Matlab程序 遗传算法解决非线性规划问题的Matlab程序 -Feasible point marking the best matching algorithm for the MATLAB code for the minimum cost maximum flow algorithm of the MATLAB program code Hungarian algorithm MATLAB code genetic algorithm to solve TSP problems Matlab procedures for genetic algorithm to solve nonlinear programming problems Matlab procedures Platform: |
Size: 119808 |
Author: |
Hits:
Description: 自适应遗传算法 求解函数最小值，在MATLAB环境下-Adaptive Genetic Algorithm for the minimum function in the MATLAB environment Platform: |
Size: 38912 |
Author:邵斓 |
Hits:
Description: matlab格式源代码。功能：利用改进遗传优化算法解决BP神经网络中局部最小问题。-matlab source code format. Function: the use of improved genetic optimization algorithm BP neural network to solve local minimum problems. Platform: |
Size: 9216 |
Author:magic |
Hits:
Description: Snake的初衷是为了进行图像分割，但它对初始位置过于敏感，且不能处理拓扑结构改变的问题。初始位
置的敏感性可以用遗传算法来克服，因为它是一种全局优化算法，且有良好的数值稳定性。为了更精确地进行图
像分割，本文提出了一种基于遗传算法的双T—Snake模型图像分割方法，它将双T—Snake模型解作为遗传算法的搜
索空间，这既继承了T—Snake模型的拓扑改变能力，又加快了遗传算法的收敛速度。由于它利用遗传算法的全局优
化性能，克服了Snake轮廓局部极小化的缺陷，从而可得到对目标的更精确的分割。将其应用于左心室MRI图像的分割，取得了较好的效果。-Snake s original intention was to carry out image segmentation, but it was too sensitive to initial position and can not deal with the issue of topology change. Initial position
The sensitivity of home can be used to overcome the genetic algorithm because it is a global optimization algorithm, and have good numerical stability. In order to more accurately map
Like segmentation, this paper presents a genetic algorithm based on dual-T-Snake model for image segmentation method, it will double-T-Snake model solution found as a genetic algorithm
Cable space, which not only inherited the T-Snake model the ability to change the topology, but also speed up the convergence rate of genetic algorithm. It uses genetic algorithms as a result of the overall excellent
Of performance, to overcome the local minimum of Snake contour deficiencies, which can be more precise on the target partition. Will be applied to MRI images of left ventricle
Segmentation, and achieved good results. Platform: |
Size: 458752 |
Author:ultraqiangda |
Hits:
Description: 自适应遗传算法，可以通过简单的调用即可实现最大值和最小值等函数-Adaptive genetic algorithm, a simple call through to the achievement of maximum and minimum values, such as function Platform: |
Size: 1024 |
Author:王国 |
Hits:
Description: matlab 遗传算法GA，粒子群算法PSO,蚁群算法AS
前段时间上智能计算方法实验课上，自己做的程序。帖到这里，希望有人能改进它们，交流经验这样更有价值。
遗传算法解决最小生成树问题，PURFER编码。
粒子群算法做无约束最优化问题。
蚁群算法解决TSP问题。
如果有宝贵经验希望能交流一下，谢谢，-matlab genetic algorithm GA, particle swarm optimization PSO, ant colony algorithm for calculation of AS some time ago on the intelligent test classes, make their own procedures. Quote here, hope someone can improve them, and exchange of experience which is more valuable. Genetic algorithm to solve the minimum spanning tree problem, PURFER coding. Particle swarm optimization to do unconstrained optimization problem. Ant colony algorithm to solve the TSP problem. If there is hope to exchange our experience, thank you, He He Platform: |
Size: 5120 |
Author:stephen |
Hits:
Description: matlab 遗传算法GA，粒子群算法PSO,蚁群算法AS
前段时间上智能计算方法实验课上，自己做的程序。帖到这里，希望有人能改进它们，交流经验这样更有价值。
遗传算法解决最小生成树问题，PURFER编码。
粒子群算法做无约束最优化问题。
蚁群算法解决TSP问题。
如果有宝贵经验希望能交流一下，谢谢，-matlab genetic algorithm GA, particle swarm optimization PSO, ant colony algorithm for calculation of AS some time ago on the intelligent test classes, make their own procedures. Quote here, hope someone can improve them, and exchange of experience which is more valuable. Genetic algorithm to solve the minimum spanning tree problem, PURFER coding. Particle swarm optimization to do unconstrained optimization problem. Ant colony algorithm to solve the TSP problem. If there is hope to exchange our experience, thank you, He He Platform: |
Size: 14336 |
Author:stephen |
Hits:
Description: 利用遗传算法求解旅行商问题
旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling salesman problem using genetic algorithm traveling salesman problem, namely, the problem TSP (Travelling Salesman Problem) is one of the famous field of mathematics. Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths. Platform: |
Size: 7168 |
Author:yanzhongyuan |
Hits:
Description: 通用的遗传算法，可实现以下问题：（a）设计出n种不同尺寸货品的排放方法，使得集装箱的空间利用率最高；（b）给出一批货物所需的最少集装箱数量。请给出在附件一对应具体问题下的最优排放及空间利用率。
-General genetic algorithm, can achieve the following questions: (a) design of size n different methods of emission goods, allowing maximum utilization of container space (b) shows the number of minimum required number of containers of goods. Please give specific issues in the corresponding Annex I emissions, and under optimal space utilization. Platform: |
Size: 22528 |
Author:zhenzhi |
Hits:
Description: 运用matlab进行遗传算法编程，旨在解决汽车发动机悬置系统的固有频率最小值的问题-The use of genetic algorithm matlab programming, automotive engine mounting system designed to address the natural frequency of the minimum problem Platform: |
Size: 1024 |
Author:小展 |
Hits:
Description: 用标准的遗传算法优化低通数字滤波器的参数，采用的方法是最小均方误差法，得到较为理想的滤波器的传递函数的系数。-Genetic algorithm using standard low-pass digital filter, the method used is the minimum mean square error method to obtain the ideal filter transfer function coefficients. Platform: |
Size: 4096 |
Author: |
Hits:
Description: 流水线车间生产调度的遗传算法MATLAB源代码
n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小-Line workshop production scheduling genetic algorithm MATLAB source code n task m phase of the process on the assembly line, each phase and at least one machine exist multiple machines at least one stage, and all the same, the processing performance of the machine on the same phase in each stage of the task to complete the procedure, the task of every working procedure can be found in the corresponding stage of any one machine processing, known task processing time of each working procedure request sort of all the tasks and each stage of the distribution of the machine, making scheduling index minimum Makespan (o) Platform: |
Size: 19456 |
Author:樊奕 |
Hits:
Description: 一个关于遗传算法优化BP神经网络的算法方案研究，遇到一个问题就是在用BP神经网络仿真的结果里，最大值和最小值预测误差特别大，而其他值的误差很小，同样，我用遗传算法优化之后这个问题依然没有解决，可以作为大家下一步研究的参考(A genetic algorithm to optimize BP neural network algorithm program, encountered a problem is that in the BP neural network simulation results, the maximum and minimum prediction error is particularly large, while the error of other values is small, the same, I use After the optimization of genetic algorithm this problem is still not solved, can be used as a reference for everyone to study next) Platform: |
Size: 376832 |
Author:sci2018
|
Hits:
Description: 遗传算法提供了求解非线性规划的通用框架，它不依赖于问题的具体领域。遗传算法的优点是将问题参数编码成染色体后进行优化， 而不针对参数本身， 从而不受函数约束条件的限制； 搜索过程从问题解的一个集合开始， 而不是单个个体， 具有隐含并行搜索特性， 可大大减少陷入局部最小的可能性。而且优化计算时算法不依赖于梯度信息，且不要求目标函数连续及可导，使其适于求解传统搜索方法难以解决的大规模、非线性组合优化问题。(Genetic algorithm provides a general framework for solving nonlinear programming, which does not depend on the specific problem domain. The advantage of genetic algorithm is that the problem parameters are encoded into chromosomes for optimization, rather than the parameters themselves. The search process starts from a set of problem solutions, rather than a single individual, and has the implicit parallel search feature, which can greatly reduce the possibility of falling into the local minimum. Moreover, the algorithm does not rely on gradient information and does not require the objective function to be continuous and differentiable, which makes it suitable for solving large-scale and nonlinear combinatorial optimization problems that are difficult to be solved by traditional search methods.) Platform: |
Size: 33792 |
Author:FZenjoys |
Hits:
Search - genetic algorithm matlab minimum