Computational Technology Resources - CCP

E. Kita, S. Maruta, H. Sugiura, "Application of Grammatical Evolution to the Santa Fe Ant Trail Problem", in Y. Tsompanakis, J. Kruis, B.H.V. Topping, (Editors), "Proceedings of the Fourth International Conference on Soft Computing Technology in Civil, Structural and Environmental Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 44, 2015. doi:10.4203/ccp.109.44

Keywords: grammatical evolution, recursive rule, Santa Fe Ant Trail Problem..

Summary

Grammatical evolution, which is one of the evolutionary computations, is designed to find functions, programs or program fragments to satisfy the design objective. Candidate solutions are defined as the strings of the integer numbers. The optimal solution is determined by the operators of genetic algorithms. One of the difficulties of the grammatical evolution is that the genetic operators sometimes violate the better partial structures of the function or program which have been already found in the parents. To improve this difficulty, the proposal algorithm uses two-dimensional chromosome definition. The Santa Fe Ant Trail Problem is considered as the numerical example. The convergence property of the proposal algorithm is compared with that of the original algorithm in order to discuss the validity.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £50 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 109 PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON SOFT COMPUTING TECHNOLOGY IN CIVIL, STRUCTURAL AND ENVIRONMENTAL ENGINEERING Edited by: Y. Tsompanakis, J. Kruis and B.H.V. Topping Paper 44 Application of Grammatical Evolution to the Santa Fe Ant Trail Problem E. Kita, S. Maruta and H. Sugiura Nagoya University, Japan doi:10.4203/ccp.109.44 purchase the full-text of this paper Full Bibliographic Reference for this paper E. Kita, S. Maruta, H. Sugiura, "Application of Grammatical Evolution to the Santa Fe Ant Trail Problem", in Y. Tsompanakis, J. Kruis, B.H.V. Topping, (Editors), "Proceedings of the Fourth International Conference on Soft Computing Technology in Civil, Structural and Environmental Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 44, 2015. doi:10.4203/ccp.109.44 Keywords: grammatical evolution, recursive rule, Santa Fe Ant Trail Problem.. Summary Grammatical evolution, which is one of the evolutionary computations, is designed to find functions, programs or program fragments to satisfy the design objective. Candidate solutions are defined as the strings of the integer numbers. The optimal solution is determined by the operators of genetic algorithms. One of the difficulties of the grammatical evolution is that the genetic operators sometimes violate the better partial structures of the function or program which have been already found in the parents. To improve this difficulty, the proposal algorithm uses two-dimensional chromosome definition. The Santa Fe Ant Trail Problem is considered as the numerical example. The convergence property of the proposal algorithm is compared with that of the original algorithm in order to discuss the validity. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £50 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions