Search - crossover

Search - crossover - List

【Mathimatics-Numerical algorithms】 MOQPSO(simple function) DL : 1: 本代码是量子粒子群算法的一个改进，基于多次塌陷和正交交叉(The code is an improvement of quantum particle swarm optimization based on multiple collapse and orthogonal crossover)
Update : 2024-05-18 Size : 823296 Publisher : xingting
【Other】 lisan DL : 0: 绘制两离散曲线的交点，不同于拟合离散点的方法(plot the crossover point of two series of discrete points)
Update : 2024-05-18 Size : 1024 Publisher : 空蒙大大
【matlab】 pso DL : 0: 用于优化参数，粒子群算法，也称粒子群优化算法或鸟群觅食算法（Particle Swarm Optimization），缩写为 PSO，是近年来由J. Kennedy和R. C. Eberhart等[1] 开发的一种新的进化算法(Evolutionary Algorithm - EA)。PSO 算法属于进化算法的一种，和模拟退火算法相似，它也是从随机解出发，通过迭代寻找最优解，它也是通过适应度来评价解的品质，但它比遗传算法规则更为简单，它没有遗传算法的“交叉”(Crossover) 和“变异”(Mutation) 操作，它通过追随当前搜索到的最优值来寻找全局最优。这种算法以其实现容易、精度高、收敛快等优点引起了学术界的重视，并且在解决实际问题中展示了其优越性。粒子群算法是一种并行算法。(For optimization of parameters,)
Update : 2024-05-18 Size : 1024 Publisher : 小苹果6688
【Other】 TSP-PSO DL : 0: 混合粒子群算法摒弃了传统粒子群算法中的通过跟踪极值来更新粒子位置的方法，而是引入了遗传算法中的交叉和变异操作，通过粒子同个体极值和群体极值的交叉以及粒子自身变异的方式来搜索最优解。(Hybrid particle swarm algorithm instead of the traditional particle swarm algorithm in the method to update the position of the particle by tracking the maximum, but the introduction of crossover and mutation in genetic algorithm, the particle swarm extremum with individual extremum and cross and variation of the particle itself to search the optimal solution.)
Update : 2024-05-18 Size : 13312 Publisher : 胡萝卜须
【Other】 DCCAchengxu DL : 1: 根据算法原理自己编写的多重分形交叉去趋势分析算法的程序，在matla2013中亲测可用(According to the algorithm principle, the multi-fractal crossover trend analysis algorithm is written by itself, which is available in matla2013.)
Update : 2024-05-18 Size : 32768 Publisher : 天高云淡淡
【】 GA最大化PSB20180117 DL : 0: 遗传算法最大化峰值旁瓣电平，给出阵元数，阵列长度，遗传及交叉因子，得出最优的PSB(The genetic algorithm maximizes the peak sidelobe level, giving the number of array elements, the length of the array, the genetic and crossover factors, and derives the optimal PSB)
Update : 2024-05-18 Size : 7168 Publisher : 南航图图
【Other】纳芯威 DL : 0: 很牛叉的D类功放设计参考资料，全系列的8脚功放(Active crossover design reference is very good)
Update : 2024-05-18 Size : 4456448 Publisher : 2548999733
【matlab】 Task_Scheduler_v1.0_beta DL : 0: Task scheduling veta kkk lll llll
Update : 2024-05-18 Size : 237568 Publisher : rabet
【Finance-Stock software system】 mt4Mql DL : 0: MQL4编写的移动平均自动交易策略。可在MT4上编译并执行。买卖信号执行条件为移动平均线金叉发生后生成买入信号。(MQL4's moving average automatic trading strategy. It can be compiled and executed on MT4. The sale of signal condition for moving average crossover occurs after generating a buy signal.)
Update : 2024-05-18 Size : 1024 Publisher : 量化交易vtester
【Other】 pso2 DL : 0: 粒子群比遗传算法规则更为简单，它没有遗传算法的“交叉”(Crossover) 和“变异”(Mutation) 操作，它通过追随当前搜索到的最优值来寻找全局最优。这种算法以其实现容易、精度高、收敛快等优点引起了学术界的重视，并且在解决实际问题中展示了其优越性。粒子群算法是一种并行算法。(It is more simple than the genetic algorithm rule. It doesn't have the crossover (Crossover) and the Mutation operation of genetic algorithm. It searches the global optimum by following the best value currently searched. This algorithm has attracted the attention of academic circles for its advantages of easy realization, high precision and fast convergence, and shows its superiority in solving practical problems. Particle swarm optimization (PSO) is a parallel algorithm.)
Update : 2024-05-18 Size : 2048 Publisher : 超人回家了
【matlab】 pso DL : 0: PSO 算法属于进化算法的一种，和模拟退火算法相似，它也是从随机解出发，通过迭代寻找最优解，它也是通过适应度来评价解的品质，但它比遗传算法规则更为简单，它没有遗传算法的"交叉"(Crossover) 和"变异"(Mutation) 操作，它通过追随当前搜索到的最优值来寻找全局最优。这种算法以其实现容易、精度高、收敛快等优点引起了学术界的重视，并且在解决实际问题中展示了其优越性。粒子群算法是一种并行算法。(The PSO algorithm is a kind of evolutionary algorithm. Similar to the simulated annealing algorithm, it also starts from the random solution and iteratively finds the optimal solution. It also evaluates the quality of the solution through fitness, but it is simpler than the genetic algorithm rules. It does not have the "Crossover" and "Mutation" operations of the genetic algorithm. It seeks the global optimum by following the current searched optimal value. This kind of algorithm has attracted much attention from the academic community because of its advantages of easy implementation, high precision and fast convergence. It also shows its superiority in solving practical problems. Particle swarm algorithm is a parallel algorithm.)
Update : 2024-05-18 Size : 1024 Publisher : cinderella345
【AI-NN-PR】 PSO-Python DL : 0: 粒子群算法，PSO 算法属于进化算法的一种，和模拟退火算法相似，它也是从随机解出发，通过迭代寻找最优解，它也是通过适应度来评价解的品质，但它比遗传算法规则更为简单，它没有遗传算法的“交叉”(Crossover) 和“变异”(Mutation) 操作，它通过追随当前搜索到的最优值来寻找全局最优。这种算法以其实现容易、精度高、收敛快等优点引起了学术界的重视，并且在解决实际问题中展示了其优越性。粒子群算法是一种并行算法。(The particle swarm optimization (PSO) algorithm, which is one of the evolutionary algorithms, is similar to the simulated annealing algorithm. It also starts from the random solution to find the optimal solution by iteration. It also evaluates the quality of the solution by the fitness, but it is more simple than the genetic algorithm rule, and it has no genetic algorithm "Crossover" and "variation". "(Mutation) operation, it seeks the global optimum by following the best value that is currently searched. This algorithm has attracted the attention of the academic community for its advantages of easy realization, high accuracy and fast convergence, and has shown its superiority in solving practical problems. Particle swarm optimization (PSO) is a parallel algorithm.)
Update : 2024-05-18 Size : 4096 Publisher : 绝情逆空
【matlab】粒子群 DL : 0: 粒子群算法，也称粒子群优化算法或鸟群觅食算法（Particle Swarm Optimization），缩写为 PSO，是近年来由J. Kennedy和R. C. Eberhart等开发的一种新的进化算法(Evolutionary Algorithm - EA)。PSO 算法属于进化算法的一种，和模拟退火算法相似，它也是从随机解出发，通过迭代寻找最优解，它也是通过适应度来评价解的品质，但它比遗传算法规则更为简单，它没有遗传算法的“交叉”(Crossover) 和“变异”(Mutation) 操作，它通过追随当前搜索到的最优值来寻找全局最优。(Particle Swarm Optimization, also known as Particle Swarm Optimization or Particle Swarm Optimization, abbreviated as PSO, is a new evolutionary algorithm developed by J. Kennedy and RC Eberhart in recent years (Evolutionary Algorithm - EA). ). The PSO algorithm is a kind of evolutionary algorithm. It is similar to the simulated annealing algorithm. It also starts from the random solution and finds the optimal solution through iteration. It also evaluates the quality of the solution by fitness, but it is simpler than the rules of genetic algorithm. It does not have the "crossover" and "mutation" operations of the genetic algorithm, which seeks global optimality by following the current searched optimal values. This kind of algorithm has attracted the attention of academic circles because of its advantages of easy implementation, high precision and fast convergence)
Update : 2024-05-18 Size : 5120 Publisher : 李彤tongtong
【matlab】 NSGA-III DL : 1: 测试可以跑，根据自己情况修改下函数即可. NSGA-III 首先定义一组参考点。然后随机生成含有 N 个（原文献说最好与参考点个数相同）个体的初始种群，其中 N 是种群大小。接下来，算法进行迭代直至终止条件满足。在第 t 代，算法在当前种群 Pt的基础上，通过随机选择，模拟两点交叉（Simulated Binary Crossover，SBX）和多项式变异产生子代种群 Qt。Pt和 Qt的大小均为 N。因此，两个种群 Pt和 Qt合并会形成种群大小为 2N 的新的种群 Rt=Pt∪Qt。为了从种群 Rt中选择最好的 N 个解进入下一代，首先利用基于Pareto支配的非支配排序将 Rt分为若干不同的非支配层（F1，F2等等）。然后，算法构建一个新的种群St，构建方法是从 F1开始，逐次将各非支配层的解加入到 St，直至 St的大小等于 N，或首次大于 N。假设最后可以接受的非支配层是 L层，那么在 L+ 1 层以及之后的那些解就被丢弃掉了，且 St\ FL中的解已经确定被选择作为 Pt+1中的解。Pt+1中余下的个体需要从 FL中选取，选择的依据是要使种群在目标空间中具有理想的多样性。(The test can run and modify the function according to its own situation. NSGA-III first defines a set of reference points. Then the initial population containing N individuals (preferably the same number of reference points as the original literature) was randomly generated, where N was the size of the population. Next, the algorithm is iterated until the termination condition is satisfied. On the basis of current population Pt, the algorithm simulates two-point crossover (SBX) and polynomial mutation to produce offspring population Qt by random selection.)
Update : 2024-05-18 Size : 14336 Publisher : 朱朱521
【Other】 Microgrid optimal scheduling DL : 1: 文章以含有蓄电池、光伏、风机以及负荷的微电网为研究对象，在考虑蓄电池充放电约束、微电网与电网功率交换约束等条件下，建立了以负荷平均供电单价最小为目标的日前优化调度模型。并利用改进交叉算子的遗传算法进行求解。以某典型微电网为例进行建模与求解，得到了微电网日前优化调度方案，实现了微电网的经济稳定运行(Taking the micro-grid with storage battery, photovoltaic, fan and load as the research object, considering the battery charging and discharging constraints, power exchange constraints between micro-grid and power grid, a daily optimal dispatching model with the objective of minimizing the average unit price of power supply is established. The improved crossover operator is used to solve the genetic algorithm. Taking a typical micro-grid as an example, the day-ahead optimal dispatching scheme of micro-grid is obtained, and the economic and stable operation of micro-grid is realized.)
Update : 2024-05-18 Size : 172032 Publisher : 阿飞之父
【Other】 GA DL : 0: 遗传算法，模拟达尔文进化论的自然选择和遗产学机理的生物进化构成的计算模型，一种不断选择优良个体的算法。谈到遗传，想想自然界动物遗传是怎么来的，自然主要过程包括染色体的选择，交叉，变异（不明白这个的可以去看看生物学），这些操作后，保证了以后的个基本上是最优的，那么以后再继续这样下去，就可以一直最优了。利用遗传算法，实现三维点云的配准。(Genetic algorithm, a computational model that simulates the biological evolution of Darwin's evolutionary theory of natural selection and inheritance mechanism, is an algorithm that continuously chooses good individuals. When it comes to inheritance, think about how animal inheritance comes from in nature. The main natural processes include chromosome selection, crossover, mutation (if you don't understand this, you can look at biology). These operations ensure that the next one is basically optimal, and then continue to do so in the future, you can always be optimal.)
Update : 2024-05-18 Size : 2190336 Publisher : 秋水不染成
【AI-NN-PR】 MATLAB genetic algorithm toolbox DL : 0: Matlab 遗传算法(Genetic Algorithm)优化工具箱是基于基本操作及终止条件、二进制和十进制相互转换等操作的综合函数库。其实现步骤包括：通过输入及输出函数求出遗传算法主函数、初始种群的生成函数，采用选择、交叉、变异操作求得基本遗传操作函数。以函数仿真为例，对该函数优化和GA 改进，只需改写函数m 文件形式即可。(The Matlab Genetic Algorithm optimization toolbox is a comprehensive function library based on basic operations and termination conditions, binary and decimal conversion and other operations. The implementation steps include: the main function of genetic algorithm and the generation function of the initial population are obtained by the input and output functions, and the basic genetic operation function is obtained by the selection, crossover and mutation operations. Taking function simulation as an example, the function optimization and GA improvement only need to rewrite function m file form)
Update : 2024-05-18 Size : 9216 Publisher : FZenjoys
【Mathimatics-Numerical algorithms】带交叉算子的量子粒子群优化算法 DL : 0: 带交叉算子的量子粒子群优化算法~~~~~~~~~~(Quantum Particle Swarm Optimization with Crossover Operator)
Update : 2024-05-18 Size : 4096 Publisher : dw dw dw dw
【matlab】 GAforPathPlaning DL : 0: 采用栅格对机器人的工作空间进行划分，再利用优化算法对机器人路径优化，是采用智能算法求最优路径的一个经典问题。目前，采用蚁群算法在栅格地图上进行路径优化取得比较好的效果，而利用遗传算法在栅格地图上进行路径优化在算法显得更加难以实现。利用遗传算法处理栅格地图的机器人路径规划的难点主要包括：1保证路径不间断，2保证路径不穿过障碍。用遗传算法解决优化问题时的步骤是固定的，就是种群初始化，选择，交叉，变异，适应度计算这样，那么下面我就说一下遗传算法求栅格地图中机器人路径规划在每个步骤的问题、难点以及解决办法。(It is a classical problem to divide the workspace of the robot by grids and optimize the path of the robot by using optimization algorithm. At present, the ant colony algorithm is used to optimize the path on the grid map, and the genetic algorithm is used to optimize the path on the grid map, which is more difficult to achieve. The difficulties of using genetic algorithm to deal with the path planning of robot on raster map mainly include: 1. guaranteeing that the path is uninterrupted, 2. guaranteeing that the path does not cross obstacles. The steps of genetic algorithm in solving optimization problems are fixed, that is, population initialization, selection, crossover, mutation, fitness calculation. Then I will talk about the problems, difficulties and solutions of genetic algorithm in each step of robot path planning in raster map.)
Update : 2024-05-18 Size : 5120 Publisher : adkuhd8wy
【Other】基于遗传算法优化BP神经网络的非线性预测 DL : 0: 针对BP神经网络的初始权值和阈值是随机选取的弊端，采用遗传算法寻优BP的初始权值和阈值，然后进行BP训练和测试。遗传算法包括编码选择交叉和变异等操作(Aiming at the disadvantage that the initial weights and thresholds of BP neural network are randomly selected, genetic algorithm is used to optimize the initial weights and thresholds of BP, and then BP training and testing are carried out. Genetic algorithm includes coding selection, crossover and mutation.)
Update : 2024-05-18 Size : 53248 Publisher : kasino

« 1 2 ... 32 33 34 35 36 3738 »