Open Access Open Access  Restricted Access Subscription or Fee Access

Parallelizing Mutations for Genetic Algorithm

Ankush Rai

Abstract


In the present work, the author has implemented the mutations crossovers of genetic algorithm (GA) over a parallelism environment. This attempt will enable us collect data to build a framework for shared parallelism for the solution of equations in the same verifiable computational time. The data indicate towards the better implementation of a larger computational problem in the parallelized for the better solution in the verifiable execution time.

Keywords: Genetic algorithm, parallelism, time complexity

 


Full Text:

PDF

References


Aporntewan C, Chongstitvatana P. A hardware implementation of the compact genetic algorithm. In Proc. Congress on Evolutionary Computation (CEC2001), Seoul, Korea. 2001; 624–9p.

Martin P. A hardware implementation of a genetic programming system using FPGAs and Handel-C. Genetic Programming and Evolvable Machines. 2001; 2(4): 317–43p.

Rich E, Knight K. Artificial Intelligence. McGraw Hill, 2nd Edn. 1991.

Larrañaga P, Kuijpers CMH, Murga R, et al. Genetic Algorithms for the Traveling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review, 13 (1999) 129–70.

Princeton University: Traveling Salesman Problem. 2005. www.math.princeton.edu/tsp/

Whitley D, Starkweather T, Fuquay D. Scheduling problems and traveling salesman: The genetic edge recombination operator. In Proc. 3rd International Conference on Genetic Algorithms, Los Altos, CA, USA. 1989; 133–40p.

Whitley D, Starkweather T, Shaner D. The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination. Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, USA. 1991; 350–72p.

Fogel DB. A parallel processing approach to a multiple traveling salesman problem using evolutionary programming. In Proc. 4th Annual Parallel Processing Symposium, Fullerton, CA, USA. 1990; 318–26p.

Fogel DB. Applying evolutionary programming to selected traveling salesman problems. Cybernetics and Systems. 1993; 24: 27–36p.

Banzhaf W. The “Molecular” Traveling Salesman. Biological Cybernetics. 1990; 64: 7–14p.

Celoxica Ltd. 2005. www.celoxica.com ()

Reinelt G. TSPLIB. www.iwr.uniheidelberg. de/groups/comopt/software/TSPLIB95/ (2004)

Sima D, Fountain T, Kacsuk P. Advanced Computer Architecture: A Design Space Approach. Addison-Wesley. 1998.


Refbacks

  • There are currently no refbacks.


This site has been shifted to https://stmcomputers.stmjournals.com/