Genetic algorithms and genetic programming: Modern concepts and practical applications

Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications

Volumn , Issue , 2009, Pages 1-365

  Affenzeller, Michael ^a   Winkler, Stephan ^a   Wagner, Stefan ^a   Beham, Andreas ^a  

^a UNIVERSITY OF APPLIED SCIENCES UPPER AUSTRIA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85055567229     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420011326     Document Type: Book

References (348)

1. W. Ashlock and D. Ashlock. Single parent genetic programming. In D. Corne et al., editors, Proceedings of the 2005 IEEE Congress on Evolutionary Computation, volume 2, pages 1172-1179, Edinburgh, UK, 2-5 September 2005. IEEE Press.
2. J. Antes and U. Derigs. A new parallel tour algorithm for the vehicle routing problem with time windows. Technical report, Institut fur Wirtschaftsinformatik und Operations Research, Universitat Koln, 1995.
3. E. Alba and B. Dorronsoro. Solving the vehicle routing problem by using cellular genetic algorithms. In J. Gottlieb and G. R. Raidl, editors, Evolutionary Computation in Combinatorial Optimization, volume 3004 of Lecture Notes in Computer Science, pages 11-20, Coimbra, Portugal, 2004. Springer.
4. E. Alba and B. Dorronsoro. Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm. Information Processing Letters,98(6):225-230, June 2006.
5. D. Alberer, L. del Re, S. Winkler, and P. Langthaler. Virtual sensor design of particulate and nitric oxide emissions in a DI diesel engine. In Proceedings of the 7th International Conference on Engines for Automobile ICE 2005, number 2005-24063, 2005.
6. M. Affenzeller. A new approach to evolutionary computation: Segregative genetic algorithms (SEGA). In J. Mira and A. Prieto, editors, Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence, volume 2084 of Lecture Notes in Computer Science, pages 594-601. Springer, 2001.
7. M. Affenzeller. Segregative genetic algorithms (SEGA): A hybrid superstructure upwards compatible to genetic algorithms for retarding premature convergence. International Journal of Computers, Systems and Signals (IJCSS),2(1):18-32, 2001.
8. th International Conference on Systems Science, volume 2, pages 346-353. Oficyna Wydawnicza Politechniki Wroclawskiej, 2001.
9. M. Affenzeller. New variants of genetic algorithms applied to problems of combinatorial optimization. In R. Trappl, editor, Cybernetics and Systems 2002, volume 1, pages 75-80. Austrian Society for Cybernetic Studies, 2002.
10. M. Affenzeller. New Hybrid Variants of Genetic Algorithms: Theoretical and Practical Aspects. Schriften der Johannes Kepler Universitat Linz. Universitatsverlag Rudolf Trauner, 2003.
11. M. Affenzeller. Population Genetics and Evolutionary Computation: Theoretical and Practical Aspects.Trauner Verlag, 2005.
12. E. Aarts and J. Korst. Simulated Annealing and Boltzman Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing.John Wiley and Sons, 1989.
13. E. Alba. Parallel Metaheuristics: A New Class of Algorithms. Wiley Interscience, 2005.
14. L. Altenberg. Emergent phenomena in genetic programming. In A. Sebald and L. Fogel, editors, Evolutionary Programming — Proceedings of the Third Annual Conference, pages 233-241, San Diego, CA, USA, 24-26 February 1994. World Scientific Publishing.
15. L. Altenberg. The Schema Theorem and Price’s Theorem. In D. Whitley and M. Vose, editors, Foundations of Genetic Algorithms 3, pages 23-49, Estes Park, Colorado, USA, 31 July-2 August 1994. Morgan Kaufmann. Published 1995.
16. T. W. Anderson. The Statistical Analysis of Time Series. Wiley, 1971.
17. O. D. Anderson. Time Series Analysis and Forecasting: the Box-Jenkins Approach.Butterworth, 1976.
18. P. J. Angeline. Evolutionary Algorithms and Emergent Intelligence.PhD thesis, Ohio State University, 1993.
19. P. J. Angeline. Genetic programming and emergent intelligence. In K. E. Kinnear, Jr., editor, Advances in Genetic Programming, chapter 4, pages 75-98. MIT Press, 1994.
20. P. J. Angeline. Subtree crossover causes bloat. In J. R. Koza et al., editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 745-752, University of Wisconsin, Madison, Wisconsin, USA, 22-25 July 1998. Morgan Kaufmann.
21. E. Alba and J. M. Troya. A survey of parallel distributed genetic algorithms. Complexity (USA),4(4):31-52, 1999.
22. M. Affenzeller and S. Wagner. SASEGASA: An evolutionary algorithm for retarding premature convergence by self-adaptive selection pressure steering. In J. Mira and J. R. Alvarez, editors, Computational Methods in Neural Modeling, volume 2686 of Lecture Notes in Computer Science, pages 438-445. Springer, 2003.
23. M. Affenzeller and S. Wagner. Reconsidering the selection concept of genetic algorithms from a population genetics inspired point of view. In R. Trappl, editor, Cybernetics and Systems 2004, volume 2, pages 701-706. Austrian Society for Cybernetic Studies, 2004.
24. M. Affenzeller and S. Wagner. SASEGASA: A new generic parallel evolutionary algorithm for achieving highest quality results. Journal of Heuristics - Special Issue on New Advances on Parallel Meta-Heuristics for Complex Problems,10:239-263, 2004.
25. M. Affenzeller and S. Wagner. Offspring selection: A new self-adaptive selection scheme for genetic algorithms. In B. Ribeiro, R. F. Albrecht, A. Dobnikar, D. W. Pearson, and N. C. Steele, editors, Adaptive and Natural Computing Algorithms, Springer Computer Science, pages 218-221. Springer, 2005.
26. M. Affenzeller, S. Wagner, and S. Winkler. Self-adaptive population size adjustment for genetic algorithms. In Proceedings of Computer Aided Systems Theory: EuroCAST 2007, Lecture Notes in Computer Science, pages 820-828. Springer, 2007.
27. M. Affenzeller, S. Winkler, and S. Wagner. Advances in Evolutionary Algorithms, chapter Evolutionary Systems Identification: New Algorithmic Concepts and Applications. Artificial Intelligence. I-tech, 2008.
28. H.-G. Beyer et al., editors.GECCO 2005: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, Washington DC, USA, 25-29 June 2005. ACM Press.
29. N. Balakrishnan. Simple heuristics for the vehicle routing problem with soft time windows. Journal of the Operational Research Society, 44(3):279-287, 1993.
30. M. Bohanec and I. Bratko. Trading accuracy for simplicity in decision trees. Machine Learning, 15:223-250, 1994.
31. P. J. Brockwell and R. A. Davis. Time Series: Theory and Methods.Springer, 1991.
32. P. J. Brockwell and R. A. Davis. A First Course in Time Series Analysis.Springer, 1996.
33. M. Bergmann. Tourenplanung mit Zeitfenstern - ein 'Überblick.Shaker Verlag, 1998.
34. E. Bradley, M. Easley, and R. Stolle. Reasoning about nonlinear system identification. Artificial Intelligence, 133:139-188, December 2001.
35. H. G. Beyer. The Theory of Evolution Strategies.Springer, 2001.
36. O. Bräysy and M. Gendreau. Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transportation Science,39(1):104-118, 2005.
37. O. Bräysy and M. Gendreau. Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science, 39(1):119-139, 2005.
38. E. K. Burke, S. Gustafson, and G. Kendall. Diversity in genetic programming: An analysis of measures and correlation with fitness. IEEE Transactions on Evolutionary Computation,8(1):47-62, 2004.
39. M. Bellmore and S. Hong. Transformation of multisalesman problem to the standard traveling salesman problem. Journal of the Association of Computer Machinery,21:500-504, 1974.
40. G. E. P. Box and G. M. Jenkins. Time Series Analysis: Forecasting and Control.Holden-Day, 1976.
41. C. Bernhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance. Branch-and-price: Column generation for solving huge integer programs. Mathematical Programming: State of the Art,46(3):316-329, 1998.
42. W. Banzhaf and C. W. G. Lasarczyk. Genetic programming of an algorithmic chemistry. In U.-M. O’Reilly, T. Yu, R. L. Ri-olo, and B. Worzel, editors, Genetic Programming Theory and Practice II, chapter 11, pages 175-190. Springer, Ann Arbor, 13-15 May 2004.
43. L. Bianco, A. Mingozzi, and S. Ricciardelli. The traveling salesman problem with cumulative costs. NETWORKS: Networks: An International Journal,23:81-91, 1993.
44. W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone. Genetic Programming - An Introduction; On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann, San Francisco, CA, USA, January 1998.
45. F. Bock. An algorithm for solving traveling-salesman and related network optimization problems. 14th National Meeting of the ORSA,1958.
46. C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys,35(3):268-308, 2003.
47. A. Bradley. The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition,30:1145-1159, 1997.
48. C. E. Brodley and P. E. Utgoff. Multivariate decision trees. Machine Learning,19(1):45-77, 1995.
49. H. Cartwright. Getting the timing right - the use of genetic algorithms in scheduling. Proceedings of Adaptive Computing and Information Processing Conference, pages 393-411, 1994.
50. D. Cavicchio. Adaptive Search Using Simulated Evolution. PhD thesis, University of Michigan, 1975.
51. N. Christofides and S. Eilon. An algorithm for the vehicle dispatching problem. Operational Research Quarterly,20:309-318, 1969.
52. R. Cheng, M. Gen, and Y. Tsujimura. A tutorial survey of job-shop scheduling problems using genetic algorithms. Part II: Hybrid genetic search strategies. Computers & Industrial Engineering, 37(1-2):51-55, 1999.
53. C. Chatfield, editor. Time Series and Forecasting.Chapman and Hall, 2001.
54. R. J. Collins and D. R. Jefferson. Antfarm: Towards simulated evolution. In C. G. Langton, C. Taylor, J. Doyne Farmer, and S. Rasmussen, editors, Artificial Life II, pages 579-601. Addison-Wesley, Redwood City, CA, 1991.
55. R. J. Collins and D. R. Jefferson. Representations for artificial organisms. In Jean-Arcady Meyer and Stewart W. Wilson, editors, Proceedings of the First International Conference on Simulation of Adaptive Behavior: From Animals to Animats, pages 382-390. MIT Press, 1991.
56. T. G. Crainic and G. Laporte. Fleet Management and Logistics.Khuwer, 1998.
57. N. Christofides, A. Mingozzi, and P. Toth. Exact algorithms for solving the vehicle routing problem based on spanning trees and shortest path relaxations. Mathematical Programming, 20(3):255-282, 1981.
58. S. Christensen and F. Oppacher. Solving the artificial ant on the Santa Fe trail problem in 20,696 fitness evaluations. In D. Thierens et al., editors, GECCO ’07: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, volume 2, pages 1574-1579, London, 7-11 July 2007. ACM Press.
59. H. P. Crowder and M. Padberg. Solving large-scale symmetric travelling salesman problems to optimality. Management Science,26:495-509, 1980.
60. W. Sam Chung and R. A. Perez. The schema theorem considered insufficient. Proceedings of the Sixth IEEE International Conference on Tools with Artificial Intelligence, pages 748-751, 1994.
61. E. Cantú-Paz. A survey of parallel genetic algorithms. Technical Report IlliGAL 97003, University of Illinois at Urbana-Champaign, 1997.
62. E. Cantú -Paz. Efficient and Accurate Parallel Genetic Algorithms.Kluwer Academic Publishers, 2001.
63. E. Cantú -Paz et al., editors.Genetic and Evolutionary Computation - GECCO 2003, Part I, volume 2723 of Lecture Notes in Computer Science, Chicago, IL, USA, 12-16 July 2003. Springer.
64. E. Cantú -Paz et al., editors. Genetic and Evolutionary Computation - GECCO 2003, Part II, volume 2724 of Lecture Notes in Computer Science.Springer, 12-16 July 2003.
65. E. Cantú -Paz and D. E. Goldberg. On the scalability of parallel genetic algorithms. Evolutionary Computation,7(4):429-449, 1999.
66. N. L. Cramer. A representation for the adapative generation of simple sequential programs. International Conference on Genetic Algorithms and Their Applications (ICGA85), pages 183-187, 1985.
67. G. Croes. A method for solving travelling-salesman problems. Operations Research,6:791-812, 1958.
68. P. Collet, M. Tomassini, M. Ebner, S. Gustafson, and A. Ekárt, editors. Proceedings of the 9th European Conference on Genetic Programming, volume 3905 of Lecture Notes in Computer Science, Budapest, Hungary, 10 - 12 April 2006. Springer.
69. G. Clarke and J. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12:568-581, 1964.
70. K. Deb et al., editors. Genetic and Evolutionary Computation - GECCO-2004, Part I, volume 3102 of Lecture Notes in Computer Science, Seattle, WA, USA, 26-30 June 2004. Springer-Verlag.
71. K. Deb et al., editors. Genetic and Evolutionary Computation - GECCO-2004, Part II, volume 3103 of Lecture Notes in Computer Science, Seattle, WA, USA, 26-30 June 2004. Springer-Verlag.
72. W. Duch, R. Adamczak, and K. Grabczewski. A new methodology of extraction, optimization and application of crisp and fuzzy logical rules. IEEE Transactions on Neural Networks, 12:277-306, 2001.
73. C. Darwin. The Origin of Species. Wordsworth Classics of World Literature. Wordsworth Editions Limited, 1998.
74. L. Davis. Applying adaptive algorithms to epistatic domains. In Proceedings of the International Joint Conference on Artificial Intelligence, 1985.
75. M. Deistler. System identification and time series analysis: Past, present, and future. In Stochastic Theory and Control: Proceedings of a Workshop held in Lawrence, Kansas, Lecture Notes in Control and Information Sciences, pages 97-110. Springer Berlin/Heidelberg, 2004.
76. K. A. DeJong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems.PhD thesis, University of Michigan, 1975.
77. K. Deb and D. E. Goldberg. An investigation of niche and species formation in genetic function optimization. In Proceedings of the Third International Conference on Genetic Algorithms, pages 42-50. Morgan Kaufmann, 1989.
78. J. E. Devaney and J. G. Hagedorn. The role of genetic programming in describing the microscopic structure of hydrating plaster. In E. Cantu-Paz et al., editors, Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), pages 91-98, New York, NY, July 2002. AAAI.
79. nd edition, 2000.
80. D. Dumitrescu, B. Lazzerini, L. C. Jain, and A. Dumitrescu. Evolutionary Computation. The CRC Press International Series on Computational Intelligence. CRC Press, 2000.
81. L. M. de Menezes and N. Y. Nikolaev. Forecasting with genetically programmed polynomial neural networks. International Journal of Forecasting, 22(2):249-265, April-June 2006.
82. W. Domschke. Logistik: Rundreisen und Touren.Oldenburg Verlag München Wien, 1990.
83. S. Dreiseitl, L. Ohno-Machado, H. Kittler, S. Vinterbo, H. Billhardt, and M. Binder. A comparison of machine learning methods for the diagnosis of pigmented skin lesions. Journal of Biomedical Informatics,34:28-36, 2001.
84. G. B. Dantzig and R. H. Ramser. The Truck Dispatching Problem. Management Science,6:80-91, 1959.
85. x virtual sensor based on structure identification and global optimization. In Proceedings of the SAE World Congress 2005, number 2005-01-0050, 2005.
86. S. Droste. Genetic programming with guaranteed quality. In J. R. Koza et al., editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 54-59, University of Wisconsin, Madison, Wisconsin, USA, 22-25 July 1998. Morgan Kaufmann.
87. M. Ebner et al., editors. Proceedings of the 10th European Conference on Genetic Programming, volume 4445 of Lecture Notes in Computer Science, Valencia, Spain, 11-13 April 2007. Springer.
88. C. F. Eick. Evolutionary Programming: Genetic Programming (http://www2.cs.uh.edu/~ceick/6367/eiben6.ppt). Department of Computer Science, University of Houston, Texas, 2007.
89. J. Eggermont, J. N. Kok, and W. A. Kosters. Detecting and pruning introns for faster decision tree evolution. In X. Yao et al., editors, Parallel Problem Solving from Nature - PPSN VIII, volume 3242 of LNCS, pages 1071-1080, Birmingham, UK, 18-22 September 2004. Springer-Verlag.
90. A. Ekart and S. Z. Nemeth. A metric for genetic programs and fitness sharing. In R. Poli et al., editors, Genetic Programming, Proceedings of EuroGP’2000, volume 1802 of LNCS, pages 259-270, Edinburgh, 15-16 April 2000. Springer-Verlag.
91. A. Ekart and S. Z. Nemeth. Selection based on the pareto nondomination criterion for controlling code growth in genetic programming. Genetic Programming and Evolvable Machines, 2(1):61-73, March 2001.
92. A. E. Eiben and J. E. Smith. Introduction to Evolutionary Computing.Springer, 2003.
93. P. Flach, H. Blockeel, C. Ferri, J. Hernuandez-Orallo, and J. Struyf. Decision support for data mining: Introduction to ROC analysis and its applications. Data mining and decision support: Integration and collaboration, 2003.
94. J. E. Fieldsend and R. M. Everson. Formulation and comparison of multi-class ROC surfaces. Proceedings of the ICML 2005 Workshop on ROC Analysis in Machine Learning, pages 41-48, 2005.
95. D. B. Fogel and A. Ghozeil. Schema processing under proportional selection in the presence of random effects. IEEE Transactions on Evolutionary Computation,1(4):290-293, 1997.
96. D. B. Fogel and A. Ghozeil. The schema theorem and the mis-allocation of trials in the presence of stochastic effects. Proceedings of the 7th International Conference on Evolutionary Programming VI,1447:313-321, 1998.
97. M. L. Fisher, K. Jornsteen, and O. B. G. Madsen. Vehicle routing with time windows: Two optimization algorithms.Operations Research,45(3):488-492, 1997.
98. B. R. Fox and M. B. McMahon. Genetic operators for sequencing problems. In Gregory J. E. Rawlins, editor, Foundations of Genetic Algorithms, pages 284-300. Morgan Kaufmann Publishers, 1991.
99. D. B. Fogel. Applying evolutionary programming to selected travelling salesman problems. Cybernetics and Systems,24:2736, 1993.
100. D. B. Fogel. An introduction to simulated evolutionary optimization. IEEE Transactions on Neural Networks, 5(1):3-14, 1994.
101. R. Forsyth. BEAGLE - A Darwinian approach to pattern recognition. Kybernetes,10:159-166, 1981.
102. C. Foisy and J. Potvin. Implementing an insertion heuristc on parallel hardware. Computers and Operations Research, 20(7):737-745, 1993.
103. P. Funes and J. Pollack. Evolutionary body building: Adaptive physical designs for robots. Artificial Life, 4(4):337-357, Fall 1998.
104. G. Folino, C. Pizzuti, and G. Spezzano. Improving cooperative GP ensemble with clustering and pruning for pattern classification. In M. Keijzer et al., editors, GECCO 2006: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, volume 1, pages 791-798, Seattle, Washington, USA, 8-12 July 2006. ACM Press.
105. U. M. Fayyad, G. Piatetsky-Shapiro, and P. Smyth. From data mining to knowledge discovery: An overview. Advances in Knowledge Discovery and Data Mining,1996.
106. M. Garcia-Arnau, D. Manrique, J. Rios, and A. Rodriguez-Paton. Initialization method for grammar-guided genetic programming. Knowledge-Based Systems, 20(2):127-133, March 2007. AI 2006, The 26th SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence.
107. Y. Gao. Population size and sampling complexity in genetic algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) 2003,2003.
108. T. Gaskell. Bases for vehicle fleet scheduling. Operational Research Quarterly, 18:281-295, 1967.
109. A. L. Garcia-Almanza and E. P. K. Tsang. Simplifying decision trees learned by genetic programming. In Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pages 7906-7912, Vancouver, 6-21 July 2006. IEEE Press.
110. J. J. Grefenstette and J. Baker. How genetic algorithms work: A critical look at implicit parallelism. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann Publishers, 1989.
111. B. L. Golden, L. Bodin, and T. Doyle. Approximate traveling salesman algorithm. Operations Research,28:694-711, 1980.
112. J. J. Grefenstette, R. Gopal, B. Rosmaita, and D. Van Gucht. Genetic algorithms for the traveling salesperson problem. International Conference on Genetic Algorithms and Their Applications, pages 160-168, 1985.
113. D. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. International Conference on Genetic Algorithms, 1985.
114. F. Glover and F. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
115. F. Glover. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13:533-549, 1986.
116. B. Gillett and L. Miller. A heuristic for the vehicle-dispatch problem. Operations Research,22:340-349, 1974.
117. P. Gill, W. Murray, and M. Wright. Practical Optimization. Academic Press, 1982.
118. B. L. Golden. Introduction to and recent advances in vehicle routing methods. Transportation Planning Models, pages 383-418, 1984.
119. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley Longman, 1989.
120. R. E. Gomory. An algorithm for integer solutions to linear programs. In R. L. Graves and P. Wolfe, editors, Recent Advances in Mathematical Programming, pages 269-302. McGraw-Hill, New York, 1963.
121. C. Gathercole and P. Ross. Dynamic training subset selection for supervised learning in genetic programming. In Y. Davi-dor, H.-P. Schwefel, and R. Manner, editors, Parallel Problem Solving from Nature III, volume 866 of LNCS, pages 312-321, Jerusalem, 9-14 October 1994. Springer-Verlag.
122. M. Grotschel. Polyedrische Charakterisierung kombinatorischer Optimierungsprobleme.PhD thesis, University of Bonn, 1977.
123. F. Gruau. Neural Network Synthesis using Cellular Encoding and the Genetic Algorithm. PhD thesis, Laboratoire de l’Informatique du Parallilisme, Ecole Normale Supirieure de Lyon, France, 1994.
124. M. Gorges-Schleuter. Genetic Algorithms and Population Structures — A Massively Parallel Algorithm.PhD thesis, University of Dortmund, 1990.
125. C. L. Hamblin. Computer languages. The Australian Journal of Science,20:135-139, 1958.
126. C. L. Hamblin. Translation to and from Polish notation. Computer Journal,5:210-213, 1962.
127. J. D. Hamilton. Time Series Analysis. Princeton University Press, 1994.
128. nd edition, 1989.
129. K. Helsgaun. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research,126(1):106-130, 2000.
130. J. B. Heywood. Internal Combustion Engine Fundamentals. McGraw-Hill, 1988.
131. A. Homaifar, S. Guan, and G. E. Liepins. A new approach on the traveling salesman problem by genetic algorithms. In Proceedings of the 5th International Conference on Genetic Algorithms, pages 460-466. Morgan Kaufmann Publishers Inc., 1993.
132. H. Tuan Hao, N. Xuan Hoai, and R. I. McKay. Does it matter where you start? A comparison of two initialisation strategies for grammar guided genetic programming. In R. I. Mckay and S.-B. Cho, editors, Proceedings of The Second Asian-Pacific Workshop on Genetic Programming, Cairns, Australia, 6-7 December 2004.
133. J. Hanley and B. McNeil. The meaning and use of the area under a receiver operating characteristic (ROC) curve. Radiology,143:29-36, 1982.
134. J. Hernandez-Orallo, C. Ferri, C. Lachiche, and P. Flach (editors). ROC Analysis in Artificial Intelligence, 1st International Workshop ROCAI-2004.2004.
135. J. H. Holland. Adaption in Natural and Artifical Systems. University of Michigan Press, 1975.
136. K. Holladay, K. Robbins, and J. von Ronne. FIFTH: A stack based GP language for vector processing. In M. Ebner et al., editors, Proceedings of the 10th European Conference on Genetic Programming, volume 4445 of Lecture Notes in Computer Science, pages 102-113, Valencia, Spain, 11-13 April 2007. Springer.
137. D. P. Helmbold and R. E. Schapire. Predicting nearly as well as the best pruning of a decision tree. Proceedings of the Eighth Annual Conference on Computational Learning Theory, pages 61-68, 1995.
138. H. J. Hamilton, N. Shan, and N. Cercone. RIAC: A rule induction algorithm based on approximate classification. Technical Report CS 96-06, Regina University, 1996.
139. T. Ito, H. Iba, and S. Sato. Non-destructive depth-dependent crossover for genetic programming. In W. Banzhaf et al., editors, Proceedings of the First European Workshop on Genetic Programming, volume 1391 of LNCS, pages 71-82, Paris, 1415 April 1998. Springer-Verlag.
140. D. Jacquette. Philosophy of Mind.Prentice Hall, 1994.
141. C. Jacob. Lindenmayer systems and growth program evolution. In T. S. Hussain, editor, Advanced Grammar Techniques Within Genetic Programming and Evolutionary Computation, pages 76-79, Orlando, Florida, USA, 13 July 1999.
142. D. Jefferson, R. Collins, C. Cooper, M. Dyer, M. Flowers, R. Korf, C. Taylor, and A. Wang. Evolution as a theme in artificial life: The genesys/tracker system. Artificial Life II, pages 417-434, 1992.
143. R. J. Jessen. Statistical investigation of a sample survey for obtaining farm facts. Research Bulletin 304, Iowa State College of Agriculture, 1942.
144. I. Jonyer, L. B. Holder, and D. J. Cook. Attribute-value selection based on minimum description length. In Proceedings of the International Conference on Artificial Intelligence, pages 1154-1159, 2004.
145. X. Jiang and Y. Motai. Incremental on-line PCA for automatic motion learning of eigen behavior. Proceedings of the 1st International Workshop on Automatic Learning and Real-Time ALaRT ‘05, pages 153-164, 2005.
146. M. Keijzer et al., editors. GECCO 2006: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, Seattle, Washington, USA, 8-12 July 2006. ACM Press.
147. R. M. Karp. Probabilistic analysis of partitioning algorithms of the traveling salesman problem in the plane. Mathematics of Operations Research,2:209-224, 1977.
148. R. M. Karp. A patching algorithm for the nonsymmetric traveling salesman problem. SIAM Journal of Computing, 8:561-573, 1979.
149. J. R. Koza, F.H. Bennett III, D. Andre, and M. A. Keane. The design of analog circuits by means of genetic programming. In P. Bentley, editor, Evolutionary Design by Computers, chapter 16, pages 365-385. Morgan Kaufmann, San Francisco, USA, 1999.
150. M. Keijzer. Efficiently representing populations in genetic programming. In P. J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 13, pages 259-278. MIT Press, Cambridge, MA, USA, 1996.
151. M. Keijzer. Scientific Discovery using Genetic Programming. PhD thesis, Danish Technical University, Lyngby, Denmark, March 2002.
152. M. G. Kendall. Time Series.Griffin, 1973.
153. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science,220:671-680, 1983.
154. J. R. Koza, F. H. Bennett III, D. Andre, and M. A. Keane. Genetic Programming III: Darvinian Invention and Problem Solving.Morgan Kaufmann Publishers, 1999.
155. K. E. Kinnear, Jr. Generality and difficulty in genetic programming: Evolving a sort. In S. Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93, pages 287-294, University of Illinois at Urbana-Champaign, 17-21 July 1993. Morgan Kaufmann.
156. J. R. Koza, M. A. Keane, M. J. Streeter, W. Mydlowec, J. Yu, and G. Lanza. Genetic Programming IV: Routine HumanCompetitive Machine Intelligence. Kluwer Academic Publishers, 2003.
157. J. R. Koza, M. A. Keane, M. J. Streeter, W. Mydlowec, J. Yu, and G. Lanza. Genetic Programming IV: Routine HumanCompetitive Machine Learning. Kluwer Academic Publishers, 2003.
158. N. Kohl and O.B.G. Madsen. An optimization algorithm for the vehicle routing problem with time windows based on lagrangean relaxation. Operations Research,45(3):395-406, 1997.
159. M. G. Kendall and J. K. Ord. Time Series. Edward Arnold, 1990.
160. M. Keijzer, U.-M. O’Reilly, S. M. Lucas, E. Costa, and T. Soule, editors. Genetic Programming 7th European Conference, EuroGP 2004, Proceedings, volume 3003 of LNCS, Coimbra, Portugal, 5-7 April 2004. Springer-Verlag.
161. J. R. Koza. Hierarchical genetic algorithms operating on populations of computer programs. In N. S. Sridharan, editor, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence IJCAI-89, volume 1, pages 768-774. Morgan Kaufmann, 20-25 August 1989.
162. J. R. Koza. A genetic approach to the truck backer upper problem and the inter-twined spiral problem. In Proceedings of IJCNN International Joint Conference on Neural Networks, volume IV, pages 310-318. IEEE Press, 1992.
163. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. The MIT Press, 1992.
164. J. R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs.The MIT Press, 1994.
165. R. Kohavi and F. Provost. Glossary of terms. Machine Learning, Special Issue on Applications of Machine Learning and the Knowledge Discovery Process,30:271-274, 1998.
166. A. Kolen, A. Rinnooy-Kan, and H. Trienekens. Vehicle routing with time windows. Operations Research,35(2):266-274, 1987.
167. S. S. Keerthi, S. K. Shevade, C. Bhattacharyya, and K. R. K. Murthy. Improvements to platt’s SMO algorithm for SVM classifier design. Neural Computation,13(3):637-649, 2001.
168. M. Keijzer, A. Tettamanzi, P. Collet, J. I. van Hemert, and M. Tomassini, editors. Proceedings of the 8th European Conference on Genetic Programming, volume 3447 of Lecture Notes in Computer Science, Lausanne, Switzerland, 30 March - 1 April 2005. Springer.
169. I. Kuscu. Evolving a generalised behavior: Artificial ant problem revisited. In V. William Porto, N. Saravanan, D. Waagen, and A. E. Eiben, editors, Seventh Annual Conference on Evolutionary Programming, volume 1447 of LNCS, pages 799-808, Mission Valley Marriott, San Diego, California, USA, 25-27 March 1998. Springer-Verlag.
170. W. B. Langdon. Evolving data structures using genetic programming. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 295-302, Pittsburgh, PA, USA, 15-19 July 1995. Morgan Kaufmann.
171. W. B. Langdon. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!, volume 1 of Genetic Programming. Kluwer, Boston, 24 April 1998.
172. W. B. Langdon. Size fair tree crossovers. In Eric Postma and Marc Gyssen, editors, Proceedings of the Eleventh Belgium/Netherlands Conference on Artificial Intelligence (BNAIC’99), pages 255-256, Kasteel Vaeshartelt, Maastricht, Holland, 3-4 November 1999.
173. W. B. Langdon. Size fair and homologous tree genetic programming crossovers. Genetic Programming and Evolvable Machines,1(1/2):95-119, April 2000.
174. G. Laporte. The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research,59:345-358, 1992.
175. J. Larsen. Parallelization of the Vehicle Routing Problem with Time Windows. PhD thesis, Department of Computer Science, University of Copenhagen, 1999.
176. P. Langthaler, D. Alberer, S. Winkler, and L. Del Re. Design eines virtuellen Sensors für Partikelmessung am Dieselmotor. In M. Horn, M. Hofbauer, and N. Dourdoumas, editors, Proceedings of the 14th Styrian Seminar on Control Engineering and Process Automation (14. Steirisches Seminar Über Regelungstechnik und Prozessautomatisierung), pages 71-87, 2005.
177. T. Loveard and V. Ciesielski. Representing classification problems in genetic programming. In Proceedings of the Congress on Evolutionary Computation, volume 2, pages 1070-1077, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, 2001. IEEE Press.
178. D. P. X. Li and V. Ciesielski. Multi-objective techniques in genetic programming for evolving classifiers. Proceedings of the 2005 Congress on Evolutionary Computation (CEC’05), pages 183-190, 2005.
179. K. Levenberg. A method for the solution of certain non-linear problems in least squares. The Quarterly of Applied Mathematics,2:164-168, 1944.
180. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady,10(8):707-710, 1966.
181. Y. Leung, Y. Gao, and Z. B. Xu. Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov chain analysis. IEEE Transactions on Neural Networks,8(5):1165-1176, 1997.
182. P. Lichodzijewski and M. I. Heywood. Pareto-coevolutionary genetic programming for problem decomposition in multi-class classification. Proceedings of the Genetic and Evolutionary Computation Conference GECCO’07, pages 464-471, 2006.
183. S. Lin. Computer solutions of the traveling salesman problem. Systems Technical Journal,44:2245-2269, 1965.
184. L. Ljung. System Identification - Theory For the User, 2nd edition. PTR Prentice Hall, Upper Saddle River, N.J., 1999.
185. S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling-salesman problem. Operations Research,21:498-516, 1973.
186. P. Larranaga, C. M. H. Kuijpers, R. H. Murga, I. Inza, and D. Dizdarevic. Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artificial Intelligence Review, 13:129-170, 1999.
187. E. L. Lawler, J. K. Lenstra, A. Rinnooy-Kan, and D. B. Shmoys. The Travelling Salesman Problem.Wiley, New York, 1985.
188. W. B. Langdon and J. P. Nordin. Seeding GP populations. In Riccardo Poli, Wolfgang Banzhaf, William B. Langdon, Julian F. Miller, Peter Nordin, and Terence C. Fogarty, editors, Genetic Programming, Proceedings of EuroGP’2000, volume 1802 of LNCS, pages 304-315, Edinburgh, 15-16 April 2000. Springer-Verlag.
189. W. B. Langdon and R. Poli. Fitness causes bloat. In P. K. Chawdhry, R. Roy, and R. K. Pant, editors, Soft Computing in Engineering Design and Manufacturing, pages 13-22. Springer-Verlag London, 23-27 June 1997.
190. W. B. Langdon and R. Poli. Why ants are hard. In J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. Riolo, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 193-201, University of Wisconsin, Madison, Wisconsin, USA, 22-25 July 1998. Morgan Kaufmann.
191. W. B. Langdon and R. Poli. Foundations of Genetic Programming. Springer Verlag, Berlin Heidelberg New York, 2002.
192. S. Luke and L. Spector. A comparison of crossover and mutation in genetic programming. In J. R. Koza et al., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 240-248, Stanford University, CA, USA, 1316 July 1997. Morgan Kaufmann.
193. J. Y. B. Lee and P. C. Wong. The effect of function noise on GP efficiency. In X. Yao, editor, Progress in Evolutionary Computation, volume 956 of Lecture Notes in Artificial Intelligence, pages 1-16. Springer-Verlag, Heidelberg, Germany, 1995.
194. P. Mahalanobis. A sample survey of the acreage under jute in Bengal. Sankhyu,4:511-530, 1940.
195. Y. Mansour. Pessimistic decision tree pruning based on tree size. Proceedings of the Fourteenth International Conference on Machine Learning, pages 195-201, 1997.
196. D. W. Marquardt. An algorithm for least-squares estimation of nonlinear parameters. SIAM Journal on Applied Mathematics, 11:431-441, 1963.
197. J. L. McCarthy. Recursive functions of symbolic expressions and their computation by machine, part I. Communications of the ACM,3(4):184-195, 1960.
198. R. I. McKay. Fitness sharing in genetic programming. In D. Whitley et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 435-442, Las Vegas, Nevada, USA, 10-12 July 2000. Morgan Kaufmann.
199. K. Menger. Zur allgemeinen Kurventheorie. Fundamenta Mathematicae,10:96-115, 1927.
200. H. Muhlenbein. Parallel genetic algorithms, population genetics and combinatorial optimization. Proceedings of the 3rd International Conference on Genetic Algorithms, pages 416-421, 1989.
201. N. F. McPhee and N. J. Hopper. Analysis of genetic diversity through population history. In W. Banzhaf et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1112-1120, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann.
202. K. Morik, M. Imhoff, P. Brockhausen, T. Joachims, and U. Gather. Knowledge discovery and knowledge validation in intensive care. Artificial Intelligence in Medicine,19:225-249, 2000.
203. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs.Springer, 1992.
204. J. Mingers. An empirical comparison of pruning methods for decision tree induction. Machine Learning,4:227 - 243, 1989.
205. M. Mitchell. An Introduction to Genetic Algorithms.The MIT Press, 1996.
206. T. M. Mitchell. Machine Learning.McGraw-Hill, New York, 2000.
207. D. C. Montgomery, C. L. Jennings, and M. Kulahci. Introduction to Time Series Analysis and Forecasting. Wiley & Sons, 2007.
208. Y. Maeda and S. Kawaguchi. Redundant node pruning and adaptive search method for genetic programming. In D. Whitley et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), page 535, Las Vegas, Nevada, USA, 10-12 July 2000. Morgan Kaufmann.
209. F. Morrison. The Art of Modeling Dynamic Systems: Forecasting for Chaos, Randomness, and Determinism.John Wiley & Sons, Inc, 1991.
210. W. S. McCulloch and W. H. Pitts. A logical calculus of the ideas imminent in nervous activity. In Bulletin of Mathematical Biophysics, volume 5, pages 115-137, 1943.
211. P. Nordin and W. Banzhaf. Complexity compression and evolution. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 310-317, Pittsburgh, PA, USA, 15-19 July 1995. Morgan Kaufmann.
212. O. Nelles. Nonlinear System Identification.Springer Verlag, Berlin Heidelberg New York, 2001.
213. D. Nolan. Quantitative parsimony. British Journal for the Philosophy of Science,48(3):329-343, 1997.
214. P. Nordin. Evolutionary Program Induction of Binary Machine Code and its Applications. PhD thesis, Universitat Dortmund, Fachbereich Informatik, 1997.
215. M. Nprgaard. Neural network based system identification toolbox. Technical Report 00-E-891, Technical University of Denmark, 2000.
216. A. E. Nix and M. D. Vose. Modeling genetic algorithms with markov chains. Annals of Mathematics and Artificial Intelligence,5(1):79-88, 1992.
217. U.-M. O’Reilly and F. Oppacher. The troubling aspects of a building block hypothesis for genetic programming. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms 3, pages 73-88, Estes Park, Colorado, USA, 31 July-2 August 1994. Morgan Kaufmann. Published 1995.
218. U.-M. O’Reilly. An Analysis of Genetic Programming. PhD thesis, Carleton University, Ottawa-Carleton Institute for Computer Science, Ottawa, Ontario, Canada, 22 September 1995.
219. U.-M. O’Reilly. Using a distance metric on genetic programs to understand genetic operators. In IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, volume 5, pages 4092-4097, Orlando, Florida, USA, 12-15 October 1997.
220. I. M. Oliver, D. J. Smith, and J. R. C. Holland. A study of permutation crossover operators on the travelling salesman problem. In J. J. Grefenstette, editor, Genetic algorithms and their applications: Proceedings of the Second International Conference on Genetic Algorithms, pages 224-230, Hillsdale, NJ, 1987. Lawrence Erlbaum Assoc.
221. I. H. Osman. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research,41(1-4):421-451, 1993.
222. A. Pankratz. Forecasting With Univariate Box-Jenkins Models: Concepts and Cases.Wiley, 1983.
223. A. Pankratz. Forecasting With Dynamic Regression Models. Wiley, 1991.
224. J.-Y. Potvin and S. Bengio. The Vehicle Routing Problem with Time Windows - Part II: Genetic Search. INFORMS Journal on Computing,8(2):165-172, 1996.
225. T. Perkis. Stack-based genetic programming. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, volume 1, pages 148-153, Orlando, Florida, USA, 27-29 June 1994. IEEE Press.
226. R. Poli and W. B. Langdon. An experimental analysis of schema creation, propagation and disruption in genetic programming. In T. Back, editor, Genetic Algorithms: Proceedings of the Seventh International Conference, pages 18-25, Michigan State University, East Lansing, MI, USA, 19-23 July 1997. Morgan Kaufmann.
227. R. Poli and W. B. Langdon. Genetic programming with one-point crossover. In P. K. Chawdhry, R. Roy, and R. K. Pant, editors, Soft Computing in Engineering Design and Manufacturing, pages 180-189. Springer-Verlag London, 23-27 June 1997.
228. R. Poli and W. B. Langdon. A new schema theory for genetic programming with one-point crossover and point mutation. In J. R. Koza et al., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 278-285, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
229. J. Platt. Fast training of support vector machines using sequential minimal optimization. In B. Schoelkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods - Support Vector Learning, pages 185-208. MIT Press, 1999.
230. R. Poli and N. F. McPhee. Exact GP schema theory for headless chicken crossover and subtree mutation. In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, pages 1062-1069, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, 27-30 May 2001. IEEE Press.
231. R. Poli and N. F. McPhee. Exact schema theorems for GP with one-point and standard crossover operating on linear structures and their application to the study of the evolution of size. In J. F. Miller, M. Tomassini, P. L. Lanzi, C. Ryan, A. G. B. Tettamanzi, and W. B. Langdon, editors, Genetic Programming, Proceedings of EuroGP’2001, volume 2038 of LNCS, pages 126-142, Lake Como, Italy, 18-20 April 2001. Springer-Verlag.
232. R. Poli and N. F. McPhee. Exact schema theory for GP and variable-length GAs with homologous crossover. In L. Spec-tor et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 104-111, San Francisco, California, USA, 7-11 July 2001. Morgan Kaufmann.
233. R. Poli and N. F. McPhee. General schema theory for genetic programming with subtree-swapping crossover: Part I. Evolutionary Computation, 11(1):53-66, March 2003.
234. R. Poli and N. F. McPhee. General schema theory for genetic programming with subtree-swapping crossover: Part II. Evolutionary Computation,11(2):169-206, June 2003.
235. R. Poli, N. F. McPhee, and J. E. Rowe. Exact schema theory and markov chain models for genetic programming and variable-length genetic algorithms with homologous crossover. Genetic Programming and Evolvable Machines,5(1):31-70, March 2004.
236. R. Poli. Evolution of graph-like programs with parallel distributed genetic programming. In T. Back, editor, Genetic Algorithms: Proceedings of the Seventh International Conference, pages 346-353, Michigan State University, East Lansing, MI, USA, 19-23 July 1997. Morgan Kaufmann.
237. R. Poli. New results in the schema theory for GP with one-point crossover which account for schema creation, survival and disruption. Technical Report CSRP-99-18, University of Birmingham, School of Computer Science, December 1999.
238. R. Poli. Parallel distributed genetic programming. In David Corne, Marco Dorigo, and Fred Glover, editors, New Ideas in Optimization, Advanced Topics in Computer Science, chapter 27, pages 403-431. McGraw-Hill, Maidenhead, Berkshire, England, 1999.
239. R. Poli. Exact schema theorem and effective fitness for GP with one-point crossover. In D. Whitley et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 469-476, Las Vegas, Nevada, USA, 10-12 July 2000. Morgan Kaufmann.
240. R. Poli. Hyperschema theory for GP with one-point crossover, building blocks, and some new results in GA theory. In R. Poli, W. Banzhaf, W. B. Langdon, J. F. Miller, P. Nordin, and T. C. Fogarty, editors, Genetic Programming, Proceedings of EuroGP’2000, volume 1802 of LNCS, pages 163-180, Edinburgh, 15-16 April 2000. Springer-Verlag.
241. R. Poli. A macroscopic exact schema theorem and a redefinition of effective fitness for GP with one-point crossover. Technical Report CSRP-00-1, University of Birmingham, School of Computer Science, February 2000.
242. R. Poli. Exact schema theory for genetic programming and variable-length genetic algorithms with one-point crossover. Genetic Programming and Evolvable Machines, 2(2):123-163, June 2001.
243. K. Popper. The Logic of Scientific Discovery.Taylor & Francis, 1992.
244. F. Previdi and T. Parisini. Model-free fault detection: a spectral estimation approach based on coherency functions. International Journal of Control,74:1107-1117, 2001.
245. J. Potvin and J. Rousseau. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operations Research, 66:331-340, 1993.
246. C. Prins. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31(12):1985-2002, 2004.
247. R. Poli, J. E Rowe, and N. F. McPhee. Markov models for GP and variable-length GAs with homologous crossover. Technical Report CSRP-01-6, University of Birmingham, School of Computer Science, January 2001.
248. C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity.Prentice-Hall, 1982.
249. F. B. Pereira, J. Tavares, P. Machado, and E. Costa. GVR: A New Genetic Representation for the Vehicle Routing Problem. In AICS’02: Proceedings of the 13th Irish International Conference on Artificial Intelligence and Cognitive Science, pages 95-102, London, UK, 2002. Springer-Verlag.
250. D. Peña, G. C. Tiao, and R. S. Tsay. A Course in Time Series Analysis.Wiley, 2001.
251. Christian Queinnec. LISP in Small Pieces. Cambridge University Press, 2003.
252. G. J. E. Rawlins, editor. Foundations of Genetic Algorithms, volume 1. Morgan Kaufmann Publishers, 1991.
253. J. P. Rosca and D. H. Ballard. Discovery of subroutines in genetic programming. In Peter J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 9, pages 177-202. MIT Press, Cambridge, MA, USA, 1996.
254. I. Rechenberg. Evolutionsstrategie.Friedrich Frommann Verlag, 1973.
255. C. Reeves. Modern Heuristic Techniques for Combinatorial Optimization.McGraw-Hill International Ltd., 1995.
256. G. Reinelt. TSPLIB - A traveling salesman problem library. ORSA Journal on Computing,3:376-384, 1991.
257. J. L. Rodriguez-Fernandez. Ockham’s razor. Endeavour, 23:121-125, 1999.
258. nd edition, 2003.
259. J. Rosca. Towards automatic discovery of building blocks in genetic programming. In E. V. Siegel and J. R. Koza, editors, Working Notes for the AAAI Symposium on Genetic Programming, pages 78-85, MIT, Cambridge, MA, USA, 1012 November 1995. AAAI.
260. J. P. Rosca. Entropy-driven adaptive representation. In Justinian P. Rosca, editor, Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, pages 23-32, Tahoe City, California, USA, 9 July 1995.
261. J. P. Rosca. Analysis of complexity drift in genetic programming. In J. R. Koza et al., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286-294, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
262. N. J. Radcliffe and P. D. Surry. Fitness variance of formae and performance prediction. In L. D. Whitley and M. D. Vose, editors, Foundations of Genetic Algorithms, volume 3, pages 51-72. Morgan Kaufmann Publishers, 1994.
263. R. A. Russell. Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science,29:156-166, 1995.
264. A. L. Samuel. Some studies in machine learning using the game of checkers. In IBM Journal of Research and Development, volume 3, pages 211-229, 1959.
265. M. W. P. Savelsbergh. Local search in routing problems with time windows. Annals of Operations Research,4:285-305, 1985.
266. H.-P. Schwefel. Evolutionsstrategie und numerische Optimierung.PhD thesis, Technische Universitat Berlin, 1975.
267. H.-P. Schwefel. Numerische Optimierung von ComputerModellen mittels der Evolutionsstrategie. Birkhäuser Verlag, Basel, Switzerland, 1994.
268. M. Solomon and J. Desrosiers. Time window constrained routing and scheduling problems. Transportation Science,22(1):1-13, 1988.
269. T. Soule and J. A. Foster. Removal bias: a new cause of code growth in tree based evolutionary programming. In 1998 IEEE International Conference on Evolutionary Computation, pages 781-786, Anchorage, Alaska, USA, 5-9 May 1998. IEEE Press.
270. T. Soule, J. A. Foster, and J. Dickinson. Code growth in genetic programming. In J. R. Koza et al., editors, Genetic Programming 1996: Proceedings of the First Annual Conference:, pages 215-223, Stanford University, CA, USA, 28-31 July 1996. MIT Press.
271. R. E. Smith, S. Forrest, and A. S. Perelson. Population diversity in an immune systems model: Implications for genetic search. In Foundations of Genetic Algorithms, volume 2, pages 153-166. Morgan Kaufmann Publishers, 1993.
272. K. Sterelny and P. E. Griffiths. Sex and Death: An Introduction to Philosophy of Biology.University of Chicago Press, 1999.
273. P. W. H. Smith and K. Harries. Code growth, explicitly defined introns, and alternative selection schemes. Evolutionary Computation, 6(4):339-360, Winter 1998.
274. E. Schoäneburg, F. Heinzmann, and S. Feddersen. Genetische Algorithmen und Evolutionsstrategien.Addison-Wesley, 1994.
275. I. K. Sigal. Computational implementation of a combined branch and bound algorithm for the travelling salesman problem. Computational Mathematics and Mathematical Physics, 26:14-19, 1986.
276. W. Schiffmann, M. Joost, and R. Werner. Optimization of the backpropagation algorithm for training multilayer percep-trons. Technical Report 15, University of Koblenz, Institute of Physics, 1992.
277. W. Schiffmann, M. Joost, and R. Werner. Comparison of optimized backpropagation algorithms. Proceedings of the European Symposium on Artificial Neural Networks ESANN’93, pages 97-104, 1993.
278. S. F. Smith. A Learning System Based on Genetic Adaptive Algorithms.PhD thesis, University of Pittsburgh, 1980.
279. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley, and C. Whitley. A comparison of genetic scheduling operators. Proceedings of the Fourth International Conference on Genetic Algorithms, pages 69-76, 1991.
280. K. Sastry, U.-M. O’Reilly, and D. E. Goldberg. Population sizing for genetic programming based on decision making. In U.-M. O’Reilly et al., editors, Genetic Programming Theory and Practice II, chapter 4, pages 49-65. Springer, Ann Arbor, 13-15 May 2004.
281. M. M. Solomon. On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. Networks,16:161-174, 1986.
282. M. M. Solomon. Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research,35:254-265, 1987.
283. M. Srinivas and L. Patnaik. Adaptive probabilities of crossover and mutation in genetic algorithms. In IEEE Trans. on Systems, Man, and Cybernetics, volume 24, pages 656-667, 1994.
284. C. R. Stephens, R. Poli, A. H. Wright, and J. E. Rowe. Exact results from a coarse grained formulation of the dynamics of variable-length genetic algorithms. In W. B. Langdon et al., editors, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 578-585, New York, 9-13 July 2002. Morgan Kaufmann Publishers.
285. A. Srinivasan. Note on the location of optimal classifiers in n-dimensional ROC space (technical report PRG-TR-2-99). Technical report, Oxford University Computing Laboratory, 1999.
286. C. R. Stephens and H. Waelbroeck. Effective degrees of freedom in genetic algorithms and the block hypothesis. Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97), pages 34-40, 1997.
287. C. R. Stephens and H. Waelbroeck. Schemata evolution and building blocks. Evolutionary Computation,7(2):109-124,1999.
288. T. Starkweather, D. Whitley, and K. Mathias. Optimization using distributed genetic algorithms. Parallel Problem Solving from Nature, pages 176-185, 1991.
289. D. Thierens et al., editors. GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, London, UK, 7-11 July 2007. ACM Press.
290. E. D. Taillard. Benchmarks for basic scheduling problems. European Journal of Operational Research,64:278-285, 1993.
291. I. Taha and J. Ghosh. Evaluation and ordering of rules extracted from feedforward networks. Proceedings of the IEEE International Conference on Neural Networks, pages 221-226, 1997.
292. M. Terrio and M. I. Heywood. Directing crossover for reduction of bloat in GP. In W. Kinsner, A. Seback, and K. Ferens, editors, IEEE CCECE 2003: IEEE Canadian Conference on Electrical and Computer Engineering, pages 1111-1115. IEEE Press, 12-15 May 2002.
293. S. R. Thangiah. Vehicle Routing with Time Windows using Genetic Algorithms, chapter Chapter 11, pages 253-278. The Practical Handbook of Genetic Algorithms: New Frontiers. CRC Press, 1995.
294. J. Ting-Ho-Lo. Synthetic approach to optimal filtering. IEEE Transactions on Neural Networks,5:803-811, 1994.
295. J. Tavares, P. Machado, F. B. Pereira, and E. Costa. On the influence of GVR in vehicle routing. In SAC’03: Proceedings of the 2003 ACM Symposium on Applied Computing, pages 753-758. ACM, 2003.
296. M. Tomassini. A survey of genetic algorithms. Annual Reviews of Computational Physics,3:87-118, 1995.
297. S. Thangiah, I. Osman, and T. Sun. Hybrid genetic algorithm simulated annealing and tabu search methods for vehicle routing problem with time windows. Technical report, Computer Science Department, Slippery Rock University, 1994.
298. S. R. Thangiah, J.-Y. Potvin, and T. Sun. Heuristic approaches to vehicle routing with backhauls and time windows. International Journal on Computers and Operations Research, 23(11):1043-1057, 1996.
299. V. Vapnik. Statistical Learning Theory.Wiley, New York, 1998.
300. A. v. Breedam. Vehicle routing: Bridging the gap between theory and practice. Belgian Journal of Operations Research, Statistics and Computer Science,35(1):63-80, 1995.
301. R. van Basshuysen and F. Schafer. Internal Combustion Engine Handbook.SAE International, 2004.
302. M. D. Vose and G. E. Liepins. Punctuated equilibria in genetic search. Complex Systems,5:31-44, 1991.
303. B. F. Voigt. Der Handlungsreisende, wie er sein soll und was er zu thun hat, um Aufträge zu erhalten und eines glücklichen Erfolgs in seinen Geschaften gewiss zu sein.Von einem alten Commis Voyageur, 1831.
304. M. D. Vose. The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge, MA, 1999.
305. M. Thorburn W. The myth of occam’s razor. Mind,27:345-353, 1918.
306. th International Conference on Systems Science, volume 1, pages 289-296. Oficyna Wydawnicza Politechniki Wroclawskiej, 2004.
307. S. Wagner and M. Affenzeller. HeuristicLab grid - a flexible and extensible environment for parallel heuristic optimization. Journal of Systems Science,30(4):103-110, 2004.
308. S. Wagner and M. Affenzeller. The heuristicLab optimization environment. Technical report, Institute of Formal Models and Verification, Johannes Kepler University, Linz, Austria, 2004.
309. S. Wagner and M. Affenzeller. HeuristicLab: A generic and extensible optimization environment. In B. Ribeiro, R. F. Albrecht, A. Dobnikar, D. W. Pearson, and N. C. Steele, editors, Adaptive and Natural Computing Algorithms, Springer Computer Science, pages 538-541. Springer, 2005.
310. S. Wagner and M. Affenzeller. Sexual GA: Gender-specific selection for genetic algorithms. In N. Callaos, W. Lesso, and E. Hansen, editors, Proceedings of the 9th World MultiConference on Systemics, Cybernetics and Informatics (WM-SCI) 2005, volume 4, pages 76-81. International Institute of Informatics and Systemics, 2005.
311. S. Winkler, M. Affenzeller, and S. Wagner. Identifying nonlinear model structures using genetic programming techniques. In R. Trappl, editor, Cybernetics and Systems 2004, volume 1, pages 689-694. Austrian Society for Cybernetic Studies, 2004.
312. thInternational Conference on Systems Science, volume 1, pages 386-393. Oficyna Wydawnicza Politechniki Wroclawskiej, 2004.
313. S. Winkler, M. Affenzeller, and S. Wagner. Genetic programming based model structure identification using on-line system data. In F. Barros, A. Bruzzone, C. Frydman, and N. Gam-biasi, editors, Proceedings of Conceptual Modeling and Simulation Conference CMS 2005, pages 177-186. Frydman, LSIS, Universite Paul Cezanne Aix Marseille III, 2005.
314. S. Winkler, M. Affenzeller, and S. Wagner. New methods for the identification of nonlinear model structures based upon genetic programming techniques. Journal of Systems Science, 31(1):5-13, 2005.
315. S. Winkler, M. Affenzeller, and S. Wagner. Advances in applying genetic programming to machine learning, focussing on classification problems. In Proceedings of the 9th International Workshop on Nature Inspired Distributed Computing NIDISC’06, part of the Proceedings of the 20th IEEE International Parallel & Distributed Processing Symposium IPDPS 2006. IEEE, 2006.
316. S. Winkler, M. Affenzeller, and S. Wagner. Automatic data based patient classification using genetic programming. In R. Trappl, R. Brachman, R.A. Brooks, H. Kitano, D. Lenat, O. Stock, W. Wahlster, and M. Wooldridge, editors, Cybernetics and Systems 2006, volume 1, pages 251-256. Austrian Society for Cybernetic Studies, 2006.
317. S. Winkler, M. Affenzeller, and S. Wagner. HeuristicModeler: A multi-purpose evolutionary machine learning algorithm and its applications in medical data analysis. In A. Bruzzone, A. Guasch, M. Piera, and J. Rozenblit, editors, Proceedings of the International Mediterranean Modelling Multiconference 13M 2006, pages 629-634. Piera, LogiSim, Barcelona, Spain, 2006.
318. S. Winkler, M. Affenzeller, and S. Wagner. Sets of receiver operating characteristic curves and their use in the evaluation of multi-class classification. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO 2006, volume 2, pages 1601-1602. Association for Computing Machinery (ACM), 2006.
319. S. Winkler, M. Affenzeller, and S. Wagner. Using enhanced genetic programming techniques for evolving classifiers in the context of medical diagnosis - an empirical study. In Proceedings of the GECCO 2006 Workshop on Medical Applications of Genetic and Evolutionary Computation (MedGEC 2006). Association for Computing Machinery (ACM), 2006.
320. S. Winkler, M. Affenzeller, and S. Wagner. Advanced genetic programming based machine learning. Journal of Mathematical Modelling and Algorithms,6(3):455-480, 2007.
321. S. Winkler, M. Affenzeller, and S. Wagner. Offspring selection and its effects on genetic propagation in genetic programming based system identification. In Robert Trappl, editor, Cybernetics and Systems 2008, volume 2, pages 549-554. Austrian Society for Cybernetic Studies, 2008.
322. P. A. Whigham and P. F. Crapper. Time series modelling using genetic programming: An application to rainfall-runoff models. In L. Spector et al., editors, Advances in Genetic Programming 3, chapter 5, pages 89-104. MIT Press, Cambridge, MA, USA, June 1999.
323. S. Winkler, H. Efendic, M. Affenzeller, L. Del Re, and S. Wagner. On-line modeling based on genetic programming. International Journal on Intelligent Systems Technologies and Applications,2(2/3):255-270, 2006.
324. W. S. Wei. Time Series Analysis - Univariate and Multivariate Methods. Addison-Wesley, 2006.
325. O. Wendt. Tourenplanung durch Einsatz naturanaloger Verfahren.Deutscher Universitätsverlag, 1995.
326. S. Winkler, H. Efendic, and L. Del Re. Quality pre-assessment in steel industry using data based estimators. In S. Cier-pisz, K. Miskiewicz, and A. Heyduk, editors, Proceedings of the IF AC Workshop MMM’2006 on Automation in Mining, Mineral and Metal Industry. International Federation for Automatic Control, 2006.
327. I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, San Francisco, 2005.
328. P. H. Winston and B. K. P. Horn. LISP.Addison Wesley, 1987.
329. D. Whitley, editor. Foundations of Genetic Algorithms, volume 2. Morgan Kaufmann Publishers, 1993.
330. P. A. Whigham. A schema theorem for context-free grammars. In 1995 IEEE Conference on Evolutionary Computation, volume 1, pages 178-181, Perth, Australia, 29 November - 1 December 1995. IEEE Press.
331. P. A. Whigham. Grammatical Bias for Evolutionary Learning. PhD thesis, School of Computer Science, University College, University of New South Wales, Australian Defence Force Academy, Canberra, Australia, 14 October 1996.
332. P. A. Whigham. Search bias, language bias, and genetic programming. In John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 230-237, Stanford University, CA, USA, 28-31 July 1996. MIT Press.
333. J. Wen-Hua, D. Madigan, and S. L. Scott. On bayesian learning of sparse classifiers. Technical Report 2003-08, Avaya Labs Research, 2003.
334. E. P. Wigner. The unreasonable effectiveness of mathematics in the natural sciences. In Communications on Pure and Applied Mathmatics, volume XIII, pages 1-14. John Wiley & Sons, Inc, New York, 1960.
335. S. Winkler. Identifying nonlinear model structures using genetic programming. Master’s thesis, Johannes Kepler University, Linz, Austria, 2004.
336. S. Winkler. Evolutionary System Identification - Modern Concepts and Practical Applications. PhD thesis, Institute for Formal Models and Verification, Johannes Kepler University Linz, 2008.
337. S. M. Weiss and I. Kapouleas. An empirical comparison of pattern recognition, neural nets, and machine learning classification methods. In J. W. Shavlik and T. G. Dietterich, editors, Readings in Machine Learning, pages 177-183. Kaufmann, San Mateo, CA, 1990.
338. A. S. Wu and R. K. Lindsay. A survey of intron research in genetics. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Parallel Problem Solving From Nature IV. Proceedings of the International Conference on Evolutionary Computation, volume 1141 of LNCS, pages 101-110, Berlin, Germany, 22-26 September 1996. Springer-Verlag.
339. S. Wright. Isolation by distance. Genetics,28:114-138, 1943.
340. D. Whitley, T. Starkweather, and D. Fuguay. Scheduling problems and traveling salesman: The genetic edge recombination operator. Proceedings of the Third International Conference on Genetic Algorithms and Their Applications, pages 133-140, 1989.
341. S. Wagner, S. Winkler, R. Braune, G. Kronberger, A. Beham, and M. Affenzeller. Benefits of plugin-based heuristic optimization software systems. 2007.
342. Y. Yoshida and N. Adachi. A diploid genetic algorithm for preserving population diversity - pseudo-meiosis GA. In Lecture Notes in Computer Science, volume 866, pages 36-45. Springer, 1994.
343. T. Yamada and R. Nakano. Genetic algorithms for job-shop scheduling problems, 1997.
344. B.-T. Zhang. A taxonomy of control schemes for genetic code growth. Position paper at the Workshop on Evolutionary Computation with Variable Size Representation at ICGA-97, 20 July 1997.
345. B.-T. Zhang. Bayesian methods for efficient genetic programming. Genetic Programming and Evolvable Machines, 1(3):217-242, July 2000.
346. K. Q. Zhu. A new genetic algorithm for VRPTW. In Proceedings of the International Conference on Artificial Intelligence, 2000.
347. B.-T. Zhang and H. Muhlenbein. Adaptive fitness functions for dynamic growing/pruning of program trees. In P. J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 12, pages 241-256. MIT Press, Cambridge, MA, USA, 1996.
348. M. H. Zweig. Receiver-operating characteristic (ROC) plots: A fundamental evaluation tool in clinical medicine. Clinical Chemistry,39:561-577, 1993.