scholarly journals Hierarchical Modularity: Decomposition of Function Structures With the Minimal Description Length Principle

2005 ◽  
Author(s):  
Bingwen Wang ◽  
Erik K. Antonsson
Keyword(s):  
Engineering Practice ◽  
Complex Structures ◽  
Tree Structures ◽  
Mutation Operators ◽  
Mdl Principle ◽  
Graph Structures ◽  
Abstract Graph ◽  
Minimal Description ◽  
Minimal Description Length ◽  
Crossover And Mutation

In engineering design and analysis, complex systems often need to be decomposed into a hierarchical combination of different simple subsystems. It’s necessary to provide formal, computable methods to hierarchically decompose complex structures. Since graph structures are commonly used as modeling methods in engineering practice, this paper presents a method to hierarchically decompose graph structures. The Minimal Description Length (MDL) principle is introduced as a measure to compare different decompositions. The best hierarchical decomposition is searched by evolutionary computation methods with newly defined crossover and mutation operators of tree structures. The results on abstract graph without attributes and a real function structure show that the technique is promising.

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.

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.

Knowledge-Intensive Evolutionary Algorithms for Solving a Healthcare Fleet Optimization Problem

2018 ◽  
pp. 192-223
Author(s):  
Carlos Adrian Catania ◽  
Cecilia Zanni-Merk ◽  
François de Bertrand de Beuvron ◽  
Pierre Collet
Keyword(s):  
Evolutionary Algorithms ◽  
Knowledge Engineering ◽  
Domain Ontology ◽  
Real Problem ◽  
Fitness Functions ◽  
Evaluation Functions ◽  
Mutation Operators ◽  
Knowledge Intensive ◽  
Definition Of ◽  
Crossover And Mutation

In this chapter, the authors show how knowledge engineering techniques can be used to guide the definition of evolutionary algorithms (EA) for problems involving a large amount of structured data, through the resolution of a real problem. Various representations of the fitness functions, the genome, and mutation/crossover operators adapted to different types of problems (routing, scheduling, etc.) have been proposed in the literature. However, real problems including specific constraints (legal restrictions, specific usages, etc.) are often overlooked by the proposed generic models. To ensure that these constraints are effectively considered, the authors propose a methodology based on the structuring of the conceptual model underlying the problem, as a labelled domain ontology suitable for optimization by EA. The authors show that a precise definition of the knowledge model with a labelled domain ontology can be used to describe the chromosome, the evaluation functions, and the crossover and mutation operators. The authors show the details for a real implementation and some experimental results.

The Canonical Representations of General Pattern Theory

2006 ◽  
Author(s):  
Ulf Grenander ◽  
Michael I. Miller
Keyword(s):  
Random Fields ◽  
Undirected Graph ◽  
General Pattern ◽  
Formal Languages ◽  
Gaussian Random Fields ◽  
Complex Structures ◽  
Pattern Theory ◽  
Graph Structures ◽  
Canonical Representations

Pattern theory is combinatory in spirit or, to use a fashionable term, connectionist: complex structures are built from simpler ones. To construct more general patterns, we will generalize from combinations of sites to combinations of primitives, termed generators, which are structured sets. The interactions between generators is imposed via the directed and undirected graph structures, defining how the variables at the sites of the graph interact with their neighbors in the graph. Probabilistic structures on the representations allow for expressing the variation of natural patterns. Canonical representations are established demonstrating a unified manner for viewing DAGs, MRFs, Gaussian random fields and probabilistic formal languages.

scholarly journals Choosing Mutation and Crossover Ratios for Genetic Algorithms—A Review with a New Dynamic Approach

Information ◽  
2019 ◽  
Vol 10 (12) ◽  
pp. 390 ◽  
Author(s):  
Ahmad Hassanat ◽  
Khalid Almohammadi ◽  
Esra’a Alkafaween ◽  
Eman Abunawas ◽  
Awni Hammouri ◽  
...  
Keyword(s):  
Population Size ◽  
Optimization Problems ◽  
Large Population ◽  
Small Population ◽  
Mutation Rates ◽  
Mutation Operators ◽  
Tuning Methods ◽  
Two Parameters ◽  
The Impact ◽  
Crossover And Mutation

Genetic algorithm (GA) is an artificial intelligence search method that uses the process of evolution and natural selection theory and is under the umbrella of evolutionary computing algorithm. It is an efficient tool for solving optimization problems. Integration among (GA) parameters is vital for successful (GA) search. Such parameters include mutation and crossover rates in addition to population that are important issues in (GA). However, each operator of GA has a special and different influence. The impact of these factors is influenced by their probabilities; it is difficult to predefine specific ratios for each parameter, particularly, mutation and crossover operators. This paper reviews various methods for choosing mutation and crossover ratios in GAs. Next, we define new deterministic control approaches for crossover and mutation rates, namely Dynamic Decreasing of high mutation ratio/dynamic increasing of low crossover ratio (DHM/ILC), and Dynamic Increasing of Low Mutation/Dynamic Decreasing of High Crossover (ILM/DHC). The dynamic nature of the proposed methods allows the ratios of both crossover and mutation operators to be changed linearly during the search progress, where (DHM/ILC) starts with 100% ratio for mutations, and 0% for crossovers. Both mutation and crossover ratios start to decrease and increase, respectively. By the end of the search process, the ratios will be 0% for mutations and 100% for crossovers. (ILM/DHC) worked the same but the other way around. The proposed approach was compared with two parameters tuning methods (predefined), namely fifty-fifty crossover/mutation ratios, and the most common approach that uses static ratios such as (0.03) mutation rates and (0.9) crossover rates. The experiments were conducted on ten Traveling Salesman Problems (TSP). The experiments showed the effectiveness of the proposed (DHM/ILC) when dealing with small population size, while the proposed (ILM/DHC) was found to be more effective when using large population size. In fact, both proposed dynamic methods outperformed the predefined methods compared in most cases tested.

scholarly journals Genetic Algorithm: Reviews, Implementations, and Applications

2020 ◽  
Vol 10 (6) ◽  
pp. 57
Author(s):  
Tanweer Alam ◽  
Shamimul Qamar ◽  
Amit Dixit ◽  
Mohamed Benaida
Keyword(s):  
Genetic Algorithm ◽  
Natural Selection ◽  
Behavioral Science ◽  
Random Search ◽  
Statistical Investigation ◽  
Adaptive Technology ◽  
Mutation Operators ◽  
Engineering Pedagogy ◽  
Crossover And Mutation ◽  
Investigation Process

Nowadays genetic algorithm (GA) is greatly used in engineering pedagogy as adaptive technology to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation challenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural selection and genetics concepts. GA is an intelligent use of random search supported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely used for maintaining high-quality reactions to optimize issues and problems investigation. These techniques are recognized to be somewhat of a statistical investigation process to search for a suitable solution or prevent an accurate strategy for challenges in optimization or searches. These techniques have been produced from natural selection or genetics principles. For random testing, historical information is provided with intelligent enslavement to continue moving the search out from the area of improved features for processing of the outcomes. It is a category of heuristics of evolutionary history using behavioral science-influenced methods like an annuity, gene, preference, or combination (sometimes refers to as hybridization). This method seemed to be a valuable tool to find solutions for problems optimization. In this paper, the author has explored the GAs, its role in engineering pedagogies, and the emerging areas where it is using, and its implementation.

A Genetic Algorithm Based Procedure for Extracting Optimal Solutions From a Morphological Chart

2007 ◽  
Author(s):  
Santosh Tiwari ◽  
Joshua Summers ◽  
Georges Fadel
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problem ◽  
Mathematical Representation ◽  
Optimal Solutions ◽  
Proof Of Concept ◽  
Optimization Framework ◽  
Mutation Operators ◽  
Novel Approach ◽  
Morphological Chart ◽  
Crossover And Mutation

A novel approach using a genetic algorithm is presented for extracting globally satisfycing (Pareto optimal) solutions from a morphological chart where the evaluation and combination of “means to sub-functions” is modeled as a combinatorial multi-objective optimization problem. A fast and robust genetic algorithm is developed to solve the resulting optimization problem. Customized crossover and mutation operators specifically tailored to solve the combinatorial optimization problem are discussed. A proof-of-concept simulation on a practical design problem is presented. The described genetic algorithm incorporates features to prevent redundant evaluation of identical solutions and a method for handling of the compatibility matrix (feasible/infeasible combinations) and addressing desirable/undesirable combinations. The proposed approach is limited by its reliance on the quantifiable metrics for evaluating the objectives and the existence of a mathematical representation of the combined solutions. The optimization framework is designed to be a scalable and flexible procedure which can be easily modified to accommodate a wide variety of design methods that are based on the morphological chart.

Sign in / Sign up

Export Citation Format

Share Document