Evolutionary Algorithm Definition
Nada M.A. AL-Salami1 Show affiliations
- Al Zaytoonah University of Jordan, Jordan
American Journal of Engineering and Applied Sciences, Volume 2, Issue 4, pp. 789–795 · doi.org/10.3844/ajeassp.2009.789.795
Abstract
Problem statement: Most resent evolutionary algorithms work under weak theoretical basis and thus, they are computationally expensive. Approach: This study discussed the use of new evolutionary algorithm for automatic programming, based on theoretical definitions of program behaviors. Evolutionary process adapted fixed and self-organized input-output specification of the problem, to evolve good finite state machine that efficiently satisfies these specifications. Results: The proposed algorithm enhanced evolutionary process by simultaneously solving multi-parts from the same problem. Conclusion: The probability that the algorithm will converge to the optimal solution was highly enhanced when decomposing the main problem into multi-part.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2009 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
AL-Salami, N. M. (2009). Evolutionary Algorithm Definition. American Journal of Engineering and Applied Sciences, 2(4), 789–795. https://doi.org/10.3844/ajeassp.2009.789.795
- Licence
- © Science Publications
- Issue
- Volume 2, Issue 4
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
