• Corpus ID: 914915

Efficiency of parallel genetic algorithm for solving N-queens problem on multicomputer platform

  title={Efficiency of parallel genetic algorithm for solving N-queens problem on multicomputer platform},
  author={Mila B. Lazarova},
The paper investigates the efficiency of parallel genetic algorithm for solving N-queens problem on a multicomputer platform. The proposed parallel computational model of the genetic algorithm is based on a parallel algorithmic paradigm of synchronous iterations. Dynamic migration of randomly selected chromosomes in a bidirectional circular model is utilized. The algorithm is implemented using both flat (pure MPI) and hybrid (MPI+OpenMP) programming models. The target parallel multicomputer… 

Tables from this paper


An overview of theoretical advances and computing trends, particularly population diversity in PGA (Parallel GA) is given and information about how various authors, researchers, scientists have parallelized GA over various parallel computing paradigms viz.

Performance comparison of three topologies of the island model of a parallel genetic algorithm implementation on a cluster platform

Three communication topologies of the island model of a PGA are implemented, with the aim of analyzing the performance of the migration models applied, and well-known benchmark functions were used.

Solving N Queen Problem Using Various Algorithms – A Survey

This paper discussed about the N queen problem which is one of the most popular NPhard problem and various methods to solve n queen problem.

Welding sequence optimisation in the automotive industry: A review

  • Varshan BeikH. MarzbaniR. Jazar
  • Materials Science, Business
    Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science
  • 2019
Spot welding is the most common technique used to join sheet metals in the automotive industry due to the fast rate of production. Optimising the welding process including the sequence, number and

Personalised modelling framework and systems for Gene Data analysis and Biomedical applications

This paper presents a meta-anatomical reconstruction of the response of the immune system to the immune attack in the context of central nervous system injury.



Migration Policies for Island Genetic Models on Multicomputer Platform

  • P. BorovskaM. Lazarova
  • Computer Science
    2007 4th IEEE Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications
  • 2007
A comparative study of five migration policies for parallel genetic algorithm (PGA) solving the traveling salesman problem (TSP) is presented, based on experimental estimation of solution quality and execution time speedup.

Solving n-Queen problem using global parallel genetic algorithm

A way in which genetic algorithms can be used to solve the n-Queen problem is shown and several conclusions are drawn about solving NP problems with genetic algorithms.

Parallel genetic algorithm taxonomy

  • M. NowostawskiR. Poli
  • Computer Science
    1999 Third International Conference on Knowledge-Based Intelligent Information Engineering Systems. Proceedings (Cat. No.99TH8410)
  • 1999
The state of the art on PGAs is reviewed and a new taxonomy also including a new form of PGA (the dynamic deme model) which was recently developed is proposed.

A Study of Five Parallel Approaches to a Genetic Algorithm for the Traveling Salesman Problem

A PGA that combines a new subtour technique with a known migration approach is identified to be the best for the traveling salesman problem among the five PGAs being compared.

Analyzing synchronous and asynchronous parallel distributed genetic algorithms

Parallel Genetic Algorithms

A universal method for parallelizing a Genetic Algorithm is given. Referred to as IIP parallel, independent and identical processing, theoretical analysis shows that the technique achieves a speedup

The N-queens problem and genetic algorithms

The authors determined how well the operators of genetic algorithms handled very difficult combinatorial and constraint satisfaction problems. The N-queens problem is a complex combinatorial problem.

Comparison of Heuristic Algorithms for the N-Queen Problem

  • I. MartinjakM. Golub
  • Computer Science
    2007 29th International Conference on Information Technology Interfaces
  • 2007
The way in which heuristic algorithms can be used to solve the n-queen problem is addressed and the reduction of the fitness function complexity to O(1) problem instances with large dimensions are solved.

A survey of parallel distributed genetic algorithms

This work makes a formalization of these algorithms, and a timely and topic survey of their most important traditional and recent technical issues, and presents a useful summaries on their main applications.

Designing scalable multi-population parallel genetic algorithms

Previous analyses of parallel GAs with multiple populations (demes) are extended to consider cases where the demes are connected in regular topologies with a xed number of neighbors, and an accurate deme sizing equation is derived.