Parallelizing Mutations for Genetic Algorithm
DOI:
https://doi.org/10.37591/rtpc.v1i3.245Abstract
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
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.
Downloads
Published
Issue
Section
License
Declaration and Copyright Transfer Form
(to be completed by authors)
I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.
- I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
- I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
- I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
- I/We also agree to the authorship of the article in the following order:
Author’s name
1. ________________
2. ________________
3. ________________
4. ________________
| We Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal. |