scholarly journals Construct Linear Polynomial Complementary Transformation for NP-Completeness Using Parallel Genetic Algorithm

2016 ◽  
Author(s):  
Tarik Eltaeib ◽  
Julius Dichter
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Parallel Genetic Algorithm ◽  
Algorithm Optimization ◽  
Parallel Genetic Algorithms ◽  
Np Completeness ◽  
Linear Polynomial ◽  
Optimization Function ◽  
Speed Up ◽  
Complementary Equation

This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.

Research on Computer Networks Reliability Optimization by Parallel Genetic Algorithms Method

2014 ◽  
Vol 543-547 ◽  
pp. 2984-2987
Author(s):  
Xu Cao ◽  
Jun Pan
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Network Topology ◽  
Coarse Grained ◽  
Reliability Optimization ◽  
Parallel Genetic Algorithm ◽  
Parallel Genetic Algorithms ◽  
Cost Constraints ◽  
Speed Up

This paper can be asserted that the use of parallel genetic algorithm can not only effectively improve the calculation speed and optimize the quality, but also can improve a lot of advantages. Reliability optimization for computer net works, subject s to cost constraints, is a NP-hard combinational problem. Reg ar ding a known network topology, the problem of choosing links and switchers among alternatives different in reliability and cost is settled by a Coarse-grained parallel genetic algorithm, which maximize the network availablity within a fixed budget. T he simulations on a dedicated cluster demonst rate that contracting to the sequential counterpart, o ur par allel GA improves the quality of plans greatly with an evident speed-up.

Master-Slave Parallel Genetic Algorithm Based on MapReduce Using Cloud Computing

2011 ◽  
Vol 121-126 ◽  
pp. 4023-4027 ◽  
Author(s):  
Guang Ming Li ◽  
Wen Hua Zeng ◽  
Jian Feng Zhao ◽  
Min Liu
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
High Performance ◽  
Low Cost ◽  
Parallel Genetic Algorithm ◽  
Parallel Genetic Algorithms ◽  
Computing Platform ◽  
Speed Up ◽  
Cloud Computing Platform ◽  
High Performance Computer

The implementation platforms of parallel genetic algorithms (PGAs) include high performance computer, cluster and Grid. Contrast with the traditional platform, a Master-slave PGA based on MapReduce (MMRPGA) of cloud computing platform was proposed. Cloud computing is a new computer platform, suites for larger-scale computing and is low cost. At first, describes the design of MMRPGA, in which the whole evolution is controlled by Master and the fitness computing is assigned to Slaves; then deduces the theoretical speed-up of MMRPGA; at last, implements MMRPGA on Hadoop and compares the speed-up with traditional genetic algorithm, the experiment result shows MMRPGA can achieve slightly lower linear speed-up with Mapper’s number.

Research on Parallel Genetic Algorithms Related Logistics Transportation Scheduling Problem

2013 ◽  
Vol 411-414 ◽  
pp. 2704-2709
Author(s):  
Yu Qiang Chen ◽  
Wei Jun Yang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Scheduling Problem ◽  
Parallel Genetic Algorithm ◽  
Parallel Genetic Algorithms ◽  
Transportation Scheduling ◽  
Simulation Results

The research based on complex RVRP. On the basis of deep analysis, a parallel genetic algorithm was designed. Simulation results proved that the parallel genetic algorithm is more excellent than conventional serial genetic algorithm.

Simulation-Based Scheduling of Waterway Projects Using a Parallel Genetic Algorithm

2015 ◽  
pp. 334-347 ◽  
Author(s):  
Ning Yang ◽  
Shiaaulir Wang ◽  
Paul Schonfeld
Keyword(s):  
Genetic Algorithm ◽  
Parallel Computing ◽  
Message Passing ◽  
Message Passing Interface ◽  
Computation Time ◽  
Parallel Genetic Algorithm ◽  
Simulation Based ◽  
Multiple Processors ◽  
Simulation Based Optimization ◽  
Speed Up

A Parallel Genetic Algorithm (PGA) is used for a simulation-based optimization of waterway project schedules. This PGA is designed to distribute a Genetic Algorithm application over multiple processors in order to speed up the solution search procedure for a very large combinational problem. The proposed PGA is based on a global parallel model, which is also called a master-slave model. A Message-Passing Interface (MPI) is used in developing the parallel computing program. A case study is presented, whose results show how the adaption of a simulation-based optimization algorithm to parallel computing can greatly reduce computation time. Additional techniques which are found to further improve the PGA performance include: (1) choosing an appropriate task distribution method, (2) distributing simulation replications instead of different solutions, (3) avoiding the simulation of duplicate solutions, (4) avoiding running multiple simulations simultaneously in shared-memory processors, and (5) avoiding using multiple processors which belong to different clusters (physical sub-networks).

scholarly journals Maximization of Eigenfrequency Gaps in a Composite Cylindrical Shell Using Genetic Algorithms and Neural Networks

2019 ◽  
Vol 9 (13) ◽  
pp. 2754 ◽  
Author(s):  
Bartosz Miller ◽  
Leonard Ziemiański
Keyword(s):  
Genetic Algorithm ◽  
Neural Networks ◽  
Genetic Algorithms ◽  
Excitation Frequency ◽  
Algorithm Optimization ◽  
External Excitation ◽  
Excitation Frequencies ◽  
Objective Function Values ◽  
Using Data ◽  
Laminated Structures

This paper presents a novel method for the maximization of eigenfrequency gaps around external excitation frequencies by stacking sequence optimization in laminated structures. The proposed procedure enables the creation of an array of suggested lamination angles to avoid resonance for each excitation frequency within the considered range. The proposed optimization algorithm, which involves genetic algorithms, artificial neural networks, and iterative retraining of the networks using data obtained from tentative optimization loops, is accurate, robust, and significantly faster than typical genetic algorithm optimization in which the objective function values are calculated using the finite element method. The combined genetic algorithm–neural network procedure was successfully applied to problems related to the avoidance of vibration resonance, which is a major concern for every structure subjected to periodic external excitations. The presented examples illustrate a combined approach to avoiding resonance through the maximization of a frequency gap around external excitation frequencies complemented by the maximization of the fundamental natural frequency. The necessary changes in natural frequencies are caused only by appropriate changes in the lamination angles. The investigated structures are thin-walled, laminated one- or three-segment shells with different boundary conditions.

scholarly journals A PARALLEL GENETIC ALGORITHM FOR THE GEOMETRICALLY CONSTRAINED SITE LAYOUT PROBLEM WITH UNEQUAL-SIZE FACILITIES

2004 ◽  
Vol 04 (04) ◽  
pp. 375-400 ◽  
Author(s):  
HAIDAR M. HARMANANI ◽  
PIERRETTE P. ZOUEIN ◽  
AOUNI M. HAJAR
Keyword(s):  
Genetic Algorithm ◽  
Message Passing ◽  
Geometric Constraints ◽  
Computer Engineering ◽  
Parallel Genetic Algorithm ◽  
Layout Problem ◽  
Parallel Genetic Algorithms ◽  
Unequal Size ◽  
Site Layout ◽  
Geometrically Constrained

Parallel genetic algorithms techniques have been used in a variety of computer engineering and science areas. This paper presents a parallel genetic algorithm to solve the site layout problem with unequal-size and constrained facilities. The problem involves coordinating the use of limited space to accommodate temporary facilities subject to geometric constraints. The problem is characterised by affinity weights used to model transportation costs between facilities, and by geometric constraints between relative positions of facilities on site. The algorithm is parallelised based on a message passing SPMD architecture using parallel search and chromosomes migration. The algorithm is tested on a variety of layout problems to illustrate its performance. In specific, in the case of: (1) loosely versus tightly constrained layouts with equal levels of interaction between facilities, (2) loosely versus tightly packed layouts with variable levels of interactions between facilities, and (3) loosely versus tightly constrained layouts. Favorable results are reported.

scholarly journals Implementation of Genetic Algorithms and Momentum Backpropagation in Classification of Subtype Cells Acute Myeloid Leukimia

2020 ◽  
Vol 14 (2) ◽  
pp. 189
Author(s):  
Dian Mustikaningrum ◽  
Retantyo Wardoyo
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
White Blood Cells ◽  
Optimization Method ◽  
Optimization Techniques ◽  
Learning Rate ◽  
Algorithm Optimization ◽  
Selection Parameter ◽  
Acute Myeloid ◽  
Random Trial

 Acute Myeloid Leukimia (AML) is a type of cancer which attacks white blood cells from myeloid. AML subtypes M1, M2, and M3 are affected by the same type of cells called myeloblasts, so it needs more detailed analysis to classify.Momentum Backpropagation  is used to classified. In its application, optimal selection of architecture, learning rate, and momentum is still done by random trial. This is one of the disadvantage of Momentum Backpropagation. This study uses a genetic algorithm (GA) as an optimization method to get the best architecture, learning rate, and momentum of artificial neural network. Genetic algorithms are one of the optimization techniques that emulate the process of biological evolution.The dataset used in this study is numerical feature data resulting from the segmentation of white blood cell images taken from previous studies which has been done by Nurcahya Pradana Taufik Prakisya. Based on these data, an evaluation of the Momentum Backpropagation process was conducted the selection parameter in a random trial with the genetic algorithm. Furthermore, the comparison of accuracy values was carried out as an alternative to the ANN learning method that was able to provide more accurate values with the data used in this study.The results showed that training and testing with genetic algorithm optimization of ANN parameters resulted in an average memorization accuracy of 83.38% and validation accuracy of 94.3%. Whereas in other ways, training and testing with momentum backpropagation random trial resulted in an average memorization accuracy of 76.09% and validation accuracy of 88.22%.

scholarly journals A Master Slave Parallel Genetic Algorithm for Feature Selection in High Dimensional Datasets

2019 ◽  
Vol 8 (3) ◽  
pp. 379-384
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Feature Selection ◽  
Information Gain ◽  
Optimal Number ◽  
Good Choice ◽  
High Dimensional ◽  
Parallel Genetic Algorithm ◽  
Efficient Manner ◽  
High Dimensional Datasets

Feature Selection in High Dimensional Datasets is a combinatorial problem as it selects the optimal subsets from N dimensional data having 2N possible subsets. Genetic Algorithms are generally a good choice for feature selection in large datasets, though for some high dimensional problems it may take varied amount of time - few seconds, few hours or even few days. Therefore, it is important to use Genetic Algorithms that can give quality results in reasonably acceptable time limit. For this purpose, it is becoming necessary to implement Genetic Algorithms in an efficient manner. In this paper, a Master Slave Parallel Genetic Algorithm is implemented as a Feature Selection procedure to diminish the time intricacies of sequential genetic algorithm. This paper describes the speed gains in parallel Master-Slave Genetic Algorithm and also discusses the theoretical analysis of optimal number of slaves required for an efficient master slave implementation. The experiments are performed on three high-dimensional gene expression data. As Genetic Algorithm is a wrapper technique and takes more time to find the importance of any feature, Information Gain technique is used first as pre-processing task to remove the irrelevant features.

Analysis of asynchronous distributed multi-master parallel genetic algorithm optimization on CAN bus

2020 ◽  
Vol 11 (4) ◽  
pp. 673-682
Author(s):  
Vahid Jamshidi ◽  
Vahab Nekoukar ◽  
Mohammad Hossein Refan
Keyword(s):  
Genetic Algorithm ◽  
Can Bus ◽  
Parallel Genetic Algorithm ◽  
Algorithm Optimization ◽  
Genetic Algorithm Optimization
Sign in / Sign up

Export Citation Format

Share Document