New Hardware Engine for New Genetic Algorithms

Abstract:

Genetic algorithm is a soft computing method that works on set of solutions. These solutions are called chromosome and the best one is the absolute solution of the problem. The main problem of this algorithm is that after passing through some generations, it may be produced some chromosomes that had been produced in some generations ago that causes reducing the convergence speed. From another respective, most of the genetic algorithms are implemented in software and less works have been done on hardware implementation. Our work implements genetic algorithm in hardware that doesn’t produce chromosome that have been produced in previous generations. In this work, most of genetic operators are implemented without producing iterative chromosomes and genetic diversity is preserved. Genetic diversity causes that not only don’t this algorithm converge to local optimum but also reaching to global optimum. Without any doubts, proposed approach is so faster than software implementations. Evaluation results also show the proposed approach is faster than hardware ones.

• Periodical: Advanced Materials Research (Volumes 490-495)
• Pages: 1831-1838
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.490-495.1831
• Online since: March 2012
• Authors: Fariborz Ahmadi, Reza Tati
• Keywords: Chromosome, Genetic Algorithm (GA), Hardware Engine, Ovum

References

[1] Fariborz Ahmadi, Amir Shikh Ahmadi, New approach to standard genetic algorithm, intenational journal of computer applications, vol 32-num10. pp.46-50.

[2] Fariborz Amadi, Reza Tati, New hardware engine for genetic algorithm, In Proc 5th international conference on genetic and evolutionary computing, (2012).

[3] Liu, J., A general purpose hardware implementation of genetic algorithms, MSc. Thesis, University of North Carolina, (1993).

[4] Scott, S.D., Samal, A. and Seth, S., HGA: a hardware-based genetic algorithm, In Proc. ACM/SIGDA 3rd. International Symposium in Field-Programmable Gate Array, p.53–59, (1995).

DOI: 10.1109/fpga.1995.241945

[5] Turton, B.H. and Arslan, T., A parallel genetic VLSI architecture for combinatorial real-time applications – disc scheduling, In Proc. IEE/IEEE International Conference on genetic Algorithms in Engineering Systems, p.88–93, (1994).

DOI: 10.1049/cp:19951097

[6] Bland, I.M. and Megson, G. M., Implementing a generic systolic array for genetic algorithms. In Proc. 1st. On-Line Workshop on Soft Computing, p.268–273, (1996).

[7] Megson, G. M. Bland, I. M., Synthesis of a systolic array genetic algorithm. In Proc. 12th. International Parallel Processing Symposium, p.316–320, (1998).

DOI: 10.1109/ipps.1998.669933

[8] D. c Goldberg. Genic algorithm in search, optimization, and machine learning. Addison welsey, (1989).

[9] Gaines, B.R., Stochastic Computing Systems, Advances in Information Systems Science, no. 2, p.37–172, (1969).

[10] Nedjah, N. and Mourelle, L.M., Reconfigurable Hardware Architecture for Compact and Efficient Stochastic Neuron, Artificial Neural Nets Problem Solving Methods, Lecture Notes in Computer Science, vol. 2687, p.17–24, (2003).

DOI: 10.1007/3-540-44869-1_3

[11] Bade, S.L. and Hutchings, B.L., FPGA-Based Stochastic Neural Networks –Implementation, IEEE Workshop on FPGAs for Custom Computing Machines, Napa Ca, April 10–13, p.189–198, (1994).

DOI: 10.1109/fpga.1994.315612

[12] Brown, B.D. and Card, H.C., Stochastic Neural Computation I: Computational Elements, IEEE Transactions on Computers, vol. 50, no. 9, p.891–905, September (2001).

DOI: 10.1109/12.954505

[13] Xilinx, http: /www. xilinx. com/, (2004).

[14] Michalewics, Z., Genetic algorithms + data structures = evolution programs, Springer-Verlag, Berlin, Second Edition, (1994).

[15] Scott, S.D., Seth, S. and Samal, A., A hardware engine for genetic algorithms, Technical Report, UNL-CSE-97-001, University of Nebraska-Lincoln, July (1997).

[16] N. Nedjah, Pararllel evolutionary computations, springer (2006).