A Re-Examination of a Real World Blood Flow Modeling Problem Using Context-Aware Crossover
This chapter describes context-aware crossover. This is an improved crossover technique for GP which always swaps subtrees into their best possible context in a parent. We show that this style of crossover is considerably more constructive than the standard method, and present several experiments to demonstrate how it operates, and how well it performs, before applying the technique to a real world application, the Blood Flow Modeling Problem.
KeywordsGenetic Program Real World Application Crossover Operator Good Individual Linear Scaling
Unable to display preview. Download preview PDF.
- Azad, R. Muhammad Atif and Ryan, Conor (2005). An examination of simultaneous evolution of grammars and solutions. In Yu, Tina, Riolo, Rick L., and Worzel, Bill, editors, Genetic Programming Theory and Practice HI, volume 9 of Genetic Programming, chapter 10, pages 141–158. Kluwer, Ann Arbor.Google Scholar
- Azad, Raja Muhammad Atif (2003). A Position Independent Representation for Evolutionary Automatic Programming Algorithms — The Chorus System. PhD thesis, University of Limerick, Ireland.Google Scholar
- Hengproprohm, S. and Chongstitvatana, P. (2001). Selective crossover in genetic programming. In ISCIT International Symposium on Communications and Information Technologies, ChiangMai Orchid, ChiangMai Thailand.Google Scholar
- Ito, Takuya, Iba, Hitoshi, and Sato, Satoshi (1998b). Non-destructive depth-dependent crossover for genetic programming. In Banzhaf, Wolfgang, Poli, Riccardo, Schoenauer, Marc, and Fogarty, Terence C., editors, Proceedings of the First European Workshop on Genetic Programming, volume 1391 of LNCS, pages 71–82, Paris. Springer-Verlag.Google Scholar
- Keijzer, Maarten (2003). Improving symbolic regression with interval arithmetic and linear scaling. In Ryan, Conor, Soule, Terence, Keijzer, Maarten, Tsang, Edward, Poli, Riccardo, and Costa, Ernesto, editors, Genetic Programming, Proceedings of EuroGP’2003, volume 2610 of LNCS, pages 70–82, Essex. Springer-Verlag.Google Scholar
- Majeed, Hammad and Ryan, Conor (2006a). A less destructive, context-aware crossover for gp. In Genetic Programming 9th European Conference, EuroGP 2006, Proceedings. Springer-Verlag.Google Scholar
- Majeed, Hammad and Ryan, Conor (2006b). Using context-aware crossover to improve the performance and lower the cost of gp. In Sumitted to GECCO 2006: Proceedings of the 2006 conference on Genetic and evolutionary computation.Google Scholar
- Ohja, M., Cobbold, R.S., and Johnston, K.W. (1994). Influence of angle on wall shear stress distribution for an end-to-side anastomosis. Journal of Vascular Surgery, 19:1067–1073.Google Scholar
- Poli, Riccardo and Langdon, William B. (1998a). On the ability to search the space of programs of standard, one-point and uniform crossover in genetic programming. Technical Report CSRP-98-7, University of Birmingham, School of Computer Science. Presented at GP-98.Google Scholar
- Poli, Riccardo and Langdon, William B. (1998b). On the search properties of different crossover operators in genetic programming. In Koza, John R., Banzhaf, Wolfgang, Chellapilla, Kumar, Deb, Kalyanmoy, Dorigo, Marco, Fogel, David B., Garzon, Max H., Goldberg, David E., Iba, Hitoshi, and Riolo, Rick, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 293–301, University of Wisconsin, Madison, Wisconsin, USA. Morgan Kaufmann.Google Scholar
- Tackett, Walter Alden (1994). Recombination, Selection, and the Genetic Construction of Computer Programs. PhD thesis, University of Southern California, Department of Electrical Engineering Systems, USA.Google Scholar
- Yuen, Chi Chung (2004). Selective crossover using gene dominance as an adaptive strategy for genetic programming. Msc intelligent systems, University College, London, UK.Google Scholar