An Operation with Crossover and Mutation of MPSO Algorithm

2021 ◽  
pp. 265-273
Author(s):  
Yuxin Zhong ◽  
Yuxin Chen ◽  
Chen Yang ◽  
Zhenyu Meng
Keyword(s):  
Crossover And Mutation

Enhanced Artificial Intelligent Method for Representing the Photonic Crystal Fiber Profile Index

2018 ◽  
Vol 1 (1) ◽  
pp. 2-19
Author(s):  
Mahmood Sh. Majeed ◽  
Raid W. Daoud
Keyword(s):  
Genetic Algorithms ◽  
Photonic Crystal ◽  
Photonic Crystal Fiber ◽  
New Method ◽  
Proper Solution ◽  
Artificial Intelligent ◽  
Crystal Fiber ◽  
Fitness Value ◽  
First Pass ◽  
Crossover And Mutation

A new method proposed in this paper to compute the fitness in Genetic Algorithms (GAs). In this new method the number of regions, which assigned for the population, divides the time. The fitness computation here differ from the previous methods, by compute it for each portion of the population as first pass, then the second pass begin to compute the fitness for population that lye in the portion which have bigger fitness value. The crossover and mutation and other GAs operator will do its work only for biggest fitness portion of the population. In this method, we can get a suitable and accurate group of proper solution for indexed profile of the photonic crystal fiber (PCF).

Finding Community of Brain Networks Based on Neighbor Index and DPSO with Dynamic Crossover

2020 ◽  
Vol 15 (4) ◽  
pp. 287-299
Author(s):  
Jie Zhang ◽  
Junhong Feng ◽  
Fang-Xiang Wu
Keyword(s):  
Brain Function ◽  
Brain Networks ◽  
Discrete Particle Swarm Optimization ◽  
Mri Brain ◽  
Mutation Operators ◽  
Neural Unit ◽  
Crossover And Mutation ◽  
The Brain ◽  
Index Table ◽  
Dynamic Crossover

Background: : The brain networks can provide us an effective way to analyze brain function and brain disease detection. In brain networks, there exist some import neural unit modules, which contain meaningful biological insights. Objective:: Therefore, we need to find the optimal neural unit modules effectively and efficiently. Method:: In this study, we propose a novel algorithm to find community modules of brain networks by combining Neighbor Index and Discrete Particle Swarm Optimization (DPSO) with dynamic crossover, abbreviated as NIDPSO. The differences between this study and the existing ones lie in that NIDPSO is proposed first to find community modules of brain networks, and dose not need to predefine and preestimate the number of communities in advance. Results: : We generate a neighbor index table to alleviate and eliminate ineffective searches and design a novel coding by which we can determine the community without computing the distances amongst vertices in brain networks. Furthermore, dynamic crossover and mutation operators are designed to modify NIDPSO so as to alleviate the drawback of premature convergence in DPSO. Conclusion: The numerical results performing on several resting-state functional MRI brain networks demonstrate that NIDPSO outperforms or is comparable with other competing methods in terms of modularity, coverage and conductance metrics.

TABU PROGRAMMING: A NEW PROBLEM SOLVER THROUGH ADAPTIVE MEMORY PROGRAMMING OVER TREE DATA STRUCTURES

2011 ◽  
Vol 10 (02) ◽  
pp. 373-406 ◽  
Author(s):  
ABDEL-RAHMAN HEDAR ◽  
EMAD MABROUK ◽  
MASAO FUKUSHIMA
Keyword(s):  
Search Algorithm ◽  
Benchmark Problems ◽  
Problem Solver ◽  
Learning Tools ◽  
Mutation Operators ◽  
Tree Data ◽  
Tree Data Structure ◽  
Comprehensive Framework ◽  
Rate Of Success ◽  
Crossover And Mutation

Since the first appearance of the Genetic Programming (GP) algorithm, extensive theoretical and application studies on it have been conducted. Nowadays, the GP algorithm is considered one of the most important tools in Artificial Intelligence (AI). Nevertheless, several questions have been raised about the complexity of the GP algorithm and the disruption effect of the crossover and mutation operators. In this paper, the Tabu Programming (TP) algorithm is proposed to employ the search strategy of the classical Tabu Search algorithm with the tree data structure. Moreover, the TP algorithm exploits a set of local search procedures over a tree space in order to mitigate the drawbacks of the crossover and mutation operators. Extensive numerical experiments are performed to study the performance of the proposed algorithm for a set of benchmark problems. The results of those experiments show that the TP algorithm compares favorably to recent versions of the GP algorithm in terms of computational efforts and the rate of success. Finally, we present a comprehensive framework called Meta-Heuristics Programming (MHP) as general machine learning tools.

scholarly journals Method for the identification of explicit polynomial formulae for the friction in turbulent pipe flow

1999 ◽  
Vol 1 (2) ◽  
pp. 115-126 ◽  
Author(s):  
J. W. Davidson ◽  
D. Savic ◽  
G. A. Walters
Keyword(s):  
Least Squares ◽  
Symbolic Regression ◽  
Regression Method ◽  
Turbulent Pipe Flow ◽  
Model Complexity ◽  
Improve Performance ◽  
Rule Based ◽  
Least Squares Optimization ◽  
Starting Solutions ◽  
Crossover And Mutation

The paper describes a new regression method for creating polynomial models. The method combines numerical and symbolic regression. Genetic programming finds the form of polynomial expressions, and least squares optimization finds the values for the constants in the expressions. The incorporation of least squares optimization within symbolic regression is made possible by a rule-based component that algebraically transforms expressions to equivalent forms that are suitable for least squares optimization. The paper describes new operators of crossover and mutation that improve performance, and a new method for creating starting solutions that avoids the problem of under-determined functions. An example application demonstrates the trade-off between model complexity and accuracy of a set of approximator functions created for the Colebrook–White formula.

scholarly journals Pioneer: A New Tool for Coding of Multi-Level Finite State Machines Based on Evolution Programming

VLSI Design ◽  
1994 ◽  
Vol 2 (2) ◽  
pp. 105-116
Author(s):  
S. Muddappa ◽  
R. Z. Makki ◽  
Z. Michalewicz ◽  
S. Isukapalli
Keyword(s):  
Finite State Machines ◽  
Mutation Rates ◽  
Natural Phenomenon ◽  
State Machines ◽  
State Assignment ◽  
Wide Range ◽  
Finite State ◽  
Multi Level ◽  
Crossover And Mutation ◽  
Evolution Programs

In this paper we present a new tool for the encoding of multi-level finite state machines based on the concept of evolution programming. Evolution programs are stochastic adaptive algorithms, based on the paradigm of genetic algorithms whose search methods model some natural phenomenon: genetic inheritance and Darwinian strife for survival. Crossover and mutation rates were tailored to the state assignment problem experimentally. We present results over a wide range of MCNC benchmarks which demonstrate the effectiveness of the new tool. The results show that evolution programs can be effectively applied to state assignment.

Simulation of the Pressure-Bearing Capacity Test Model in Architectural Decoration Design

2014 ◽  
Vol 716-717 ◽  
pp. 391-394
Author(s):  
Li Mei Guo ◽  
Ai Min Xiao
Keyword(s):  
Genetic Algorithm ◽  
Bearing Capacity ◽  
Test Method ◽  
Test Model ◽  
Improved Genetic Algorithm ◽  
Good Convergence ◽  
Mutation Operators ◽  
Process Pressure ◽  
Calculation Process ◽  
Crossover And Mutation

in architectural decoration process, pressure-bearing capacity test is the foundation of design, and is very important. To this end, a pressure-bearing capacity test method in architectural decoration design is proposed based on improved genetic algorithm. The selection, crossover and mutation operators in genetic algorithm are improved respectively. Using its fast convergence characteristics eliminate the pressure movement in the calculation process. The abnormal area of pressure-bearing existed in buildings which can ensure to be tested is added, to obtain accurate distribution information of the abnormal area of pressure-bearing. Simulation results show that the improved genetic algorithm has good convergence, can accurately test the pressure-bearing capacity in architectural decoration.

scholarly journals SCHEDULLING MODEL OF REPLENISHMENT AT SEA FOR STRICKING FORCE UNIT IN SEA OPERATION USING GENETIC ALGORITHM

JOURNAL ASRO ◽  
2019 ◽  
Vol 10 (2) ◽  
pp. 1
Author(s):  
Aris Tri Ika R ◽  
Benny Sukandari ◽  
Okol Sri Suharyo ◽  
Ayip Rivai Prabowo
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Time Windows ◽  
Lubricating Oil ◽  
Optimal Time ◽  
Routing Problem ◽  
Scheduling Model ◽  
Force Unit ◽  
Replenishment At Sea ◽  
Crossover And Mutation

Navy as a marine core in the defense force is responsible for providing security for realizing stability and security of the country.  At any time there was an invasion of other countries past through sea,  TNI AL must be able to break the enemy resistance line through a sea operation to obtain the sea superiority. But this time the endurance of Striking force Unit at only 7-10 days and required replenishment at sea to maximize the presence in the theater of operations to meet a demand of the logistics: HSD, Freshwater, Lubricating Oil, foodstuffs and amonisi. For the optimal replenishment at sea required scheduling model supporting unit to get the minimum time striking force unit was on node rendezvous. Replenishment at sea scheduling model for striking force unit refers to the problems Vehicle routing problem with time windows using Genetic Algorithms. These wheelbase used is roulette for reproduction, crossover, and mutation of genes. Genetic algorithms have obtained optimum results in the shortest route provisioning scenario uses one supporting unit with a total time of 6.89 days. In scenario two supporting unit with minimal time is 4.97 days. In the scenario, the changing of the node replenishment Genetic Algorithm also get optimal time is 4.97 days with two supporting units. Research continued by changing the parameters of the population, the probability of crossover and mutation that can affect the performance of the genetic algorithm to obtain the solution. Keywords: Genetic Algorithm, Model Scheduling, Striking Force unit

scholarly journals Explorations in Parallel  Linear Genetic Programming

2021 ◽  
Author(s):  
◽  
Carlton Downey
Keyword(s):  
Genetic Programming ◽  
Convergence Time ◽  
Linear Genetic Programming ◽  
Cooperative Coevolution ◽  
Biological Inspiration ◽  
Linear Sequence ◽  
New Form ◽  
Program Output ◽  
Program Components ◽  
Crossover And Mutation

<p>Linear Genetic Programming (LGP) is a powerful problem-solving technique, but one with several significant weaknesses. LGP programs consist of a linear sequence of instructions, where each instruction may reuse previously computed results. This structure makes LGP programs compact and powerful, however it also introduces the problem of instruction dependencies. The notion of instruction dependencies expresses the concept that certain instructions rely on other instructions. Instruction dependencies are often disrupted during crossover or mutation when one or more instructions undergo modification. This disruption can cause disproportionately large changes in program output resulting in non-viable offspring and poor algorithm performance. Motivated by biological inspiration and the issue of code disruption, we develop a new form of LGP called Parallel LGP (PLGP). PLGP programs consist of n lists of instructions. These lists are executed in parallel, and the resulting vectors are summed to produce the overall program output. PLGP limits the disruptive effects of crossover and mutation, which allows PLGP to significantly outperform regular LGP. We examine the PLGP architecture and determine that large PLGP programs can be slow to converge. To improve the convergence time of large PLGP programs we develop a new form of PLGP called Cooperative Coevolution PLGP (CC PLGP). CC PLGP adapts the concept of cooperative coevolution to the PLGP architecture. CC PLGP optimizes all program components in parallel, allowing CC PLGP to converge significantly faster than conventional PLGP. We examine the CC PLGP architecture and determine that performance</p>

Sign in / Sign up

Export Citation Format

Share Document