A parallel genetic algorithm to speed up the resolution of the algorithm selection problem

Author(s):  
Alejandro Marrero ◽  
Eduardo Segredo ◽  
Coromoto Leon
Author(s):  
Ning Yang ◽  
Shiaaulir Wang ◽  
Paul Schonfeld

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).


2011 ◽  
Vol 121-126 ◽  
pp. 4023-4027 ◽  
Author(s):  
Guang Ming Li ◽  
Wen Hua Zeng ◽  
Jian Feng Zhao ◽  
Min Liu

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.


Author(s):  
Tarik Eltaeib ◽  
Julius Dichter

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.


Author(s):  
Ning Yang ◽  
Shiaaulir Wang ◽  
Paul Schonfeld

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).


2011 ◽  
Vol 121-126 ◽  
pp. 4151-4155 ◽  
Author(s):  
Jian Feng Zhao ◽  
Wen Hua Zeng ◽  
Guang Ming Li ◽  
Min Liu

Cloud computing is a novel parallel platform, this paper proposed a kind of simple parallel genetic algorithm (PGA) using Cloud computing called SMRPGA. Comparing with the traditional PGAs using high performance computers (HPC), cluster or Grid, SMRPGA is simple and easy to be implemented. Another advantage is that PGA using Cloud computing is easy to be extend to larger-scale, which is very useful for solving the time-consuming problems. A prototype is implemented based on Hadoop, which is an open source Cloud computing. The result of running two benchmark functions showed that the speed-up of PGA using Cloud Computing is not obvious considering the long communication time and it is suitable to solve the time-consuming problems.


2014 ◽  
Vol 543-547 ◽  
pp. 2984-2987
Author(s):  
Xu Cao ◽  
Jun Pan

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.


Author(s):  
M. Y. Jiang ◽  
X. J. Fan ◽  
Y. X. Zhou ◽  
J. Lian ◽  
J. Q. Jiang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document