- Email: [email protected]
Evolutionary algorithms
Information Sciences 133 (2001) 101±102
www.elsevier.com/locate/ins
Editorial
Evolutionary algorithms Manuel Gra~ na Depto. de Ciencas de la Comput. e IA, Facultad de Informatica, Universidad del Pais Vasco, Aptdo. 649, San Sebastian Donostia 20080, Spain
The papers collected in this special issue Information Sciences are extended and revised versions of papers presented at the 3d workshop on the Frontiers of Evolutionary Algorithms, embedded in the JCIS'2000 held in Atlantic City from 27 February to 3 March. Papers submitted for presentation at the workshop underwent a careful review process, performed by the members of the scienti®c committee. Their generous response is the key to the scienti®c success of the workshop. Nearly 30% of the papers submitted were not accepted according to the referees' evaluation. Some 30 papers were presented at the workshop. The average presentation reached a high quality standard. Despite the workshop's small size, it contained a good representation of the current trends in some of the areas of application and fundamentals of evolutionary algorithms (EA), ful®lling the goals of its stated mission. The selection of the papers for this special issue on EA was done on the basis of the reviewers' reports. The authors' best rated papers were asked to submit an extended and revised version of their work. The process of gathering all the papers ready for collective submission to the Managing Editor Dr. Wang has been harder and slower than I had forseen (not an unusual thing to happen, I guess). There is nowadays a big momentum of publications and conferences in Evolution-related computational issues. A great number of specialized subjects have sprouted from the initial works on genetic algorithms and classi®er systems, therefore the choice of ``evolutionary algorithms (EA)'' as the keywords for the workshop seems nowadays very smart. The contents of the present issue cover a wide spectra of applications and theory of EA, that by no means pretend to be exhaustive. B. Olsson studies the application of asymmetric host±parasite coevolution as a means to overcome convergence problems in classical EA. J. Santos et al., address the issue of applying EA to the task of designing ANN for robust control of mobile robots, and diculties involved in the transference of the results obtained in simulation domains into the real robot. J.C. Oh introduces the kinship E-mail address: [email protected] 0020-0255/01/$ - see front matter Ó 2001 Elsevier Science Inc. All rights reserved. PII: S 0 0 2 0 - 0 2 5 5 ( 0 1 ) 0 0 0 7 9 - 2
102
Manuel Gra~na / Information Sciences 133 (2001) 101±102
biased conditional cooperation strategy as a means to enforce cooperation between individuals and convergence to diversity preserving populations. H. Timucin Ozdemir and C.K. Mohan deal with a combinatorial problem in most classical tradition of genetic algorithms (GA): the crew scheduling. Y.S. Yeun et al., employ genetic programming (GP) trees for smooth ®tting of curves and contribute a new method to determine the regularization parameter to be used in the selection of GP trees. H. Fr ohlich et al., dealt with another combinational problem, that of ®nding the maximum common subgraph, with an interesting application in the design of ®eld programmable gate arrays (FPGA). A.F. Sheta and K. De Jong apply GA tune the radial basis function parameters with a promising application to time series prediction. S. Tsutsui and D.E. Goldberg give an analysis of boundary extension methods proposed to cope with the closing of crossover operators in GA with real valued individuals given by a real valued codi®cation. A.I. Gonzalez et al., present the results of applying an evolutionary adaptation strategy to the computation of image codebooks used for the posterior image ®ltering and segmentation. Finally, A.L. Buczak et al. presents an interesting application to the automatic optimization of sensor networks. I am grateful to Dr. Goldberg for his guidance and support during the building up of the workshop, to my co-chairs Richard Duro and Alicia d'Anjou for their work, support and advice, and to Dr. Wang for giving me the opportunity to collaborate in this exciting workshop form the organization side. Also Mrs. Anna Menzies has been a great support and made all things go smooth. Finally, my heartfelt thanks to the members of the program committee whose contributed time and knowledge made possible the distinguished academic level of presentations at the workshop. Jarmo Alander (Univ. Vaasa, Finland), Thomas Baeck (Dortmund, Germany) Anna L. Buczak (AlliedSignal), Stefano Cagnoni (Univ. Parma, Italy), Fulvio Corno (Politecnico di Torino, Italy), Marie Cottrell (Univ. Paris 1, France), Alicia d' Anjou (Univ. Pais Vasco, Spain), Berna Dengiz (Gazi Univ., Turkey), Gerry V. Dozier (Auburn Univ. USA), Richard Duro (Univ. A Coru~ na, Spain), Hillol Kargupta (WSU, USA), Han-gyoo Kim (Hongik, Korea), Evelyne Lutton (INRIA, France), Bernard Manderick (Free Univ. of Brussels, Belgium), John McCall (UK), Zbigniew Michalewicz (Univ. North Carolina, USA), Jae C.Oh (Univ. of Pittsburgh, USA), Andres Perez-Uribe (Swiss Federal Institute of Technology-Lausanne), Jennifer L. Pittman (Penn State Univ. USA), Marc Schoenauer (CMA ± Ecole Polytechnique, Palaiseau, France), George D Smith (Univ. East Anglia, UK), Robert Smith (UWE, UK), Peter Stavroulakis (Telecommunication Systems Institute, Creete, Greece), Hideaki Suzuki (ATR, Japan) Hideyuki Takagi (Kyushu Institute of Design, Japan), Shigeyoshi Tsutsui (Hannan Univ., Japan), J. Luis Verdegay (Univ. Granada, Spain), David Wolpert (NASA Ames Research Center, USA), Xin Yao (Univ. of Birmingham, UK), Yun Seog Yeun (Daejin Jin U. Korea), Zhang Yunfeng (Nat. Univ. Singapore, Singapore).
www.elsevier.com/locate/ins
Editorial
Evolutionary algorithms Manuel Gra~ na Depto. de Ciencas de la Comput. e IA, Facultad de Informatica, Universidad del Pais Vasco, Aptdo. 649, San Sebastian Donostia 20080, Spain
The papers collected in this special issue Information Sciences are extended and revised versions of papers presented at the 3d workshop on the Frontiers of Evolutionary Algorithms, embedded in the JCIS'2000 held in Atlantic City from 27 February to 3 March. Papers submitted for presentation at the workshop underwent a careful review process, performed by the members of the scienti®c committee. Their generous response is the key to the scienti®c success of the workshop. Nearly 30% of the papers submitted were not accepted according to the referees' evaluation. Some 30 papers were presented at the workshop. The average presentation reached a high quality standard. Despite the workshop's small size, it contained a good representation of the current trends in some of the areas of application and fundamentals of evolutionary algorithms (EA), ful®lling the goals of its stated mission. The selection of the papers for this special issue on EA was done on the basis of the reviewers' reports. The authors' best rated papers were asked to submit an extended and revised version of their work. The process of gathering all the papers ready for collective submission to the Managing Editor Dr. Wang has been harder and slower than I had forseen (not an unusual thing to happen, I guess). There is nowadays a big momentum of publications and conferences in Evolution-related computational issues. A great number of specialized subjects have sprouted from the initial works on genetic algorithms and classi®er systems, therefore the choice of ``evolutionary algorithms (EA)'' as the keywords for the workshop seems nowadays very smart. The contents of the present issue cover a wide spectra of applications and theory of EA, that by no means pretend to be exhaustive. B. Olsson studies the application of asymmetric host±parasite coevolution as a means to overcome convergence problems in classical EA. J. Santos et al., address the issue of applying EA to the task of designing ANN for robust control of mobile robots, and diculties involved in the transference of the results obtained in simulation domains into the real robot. J.C. Oh introduces the kinship E-mail address: [email protected] 0020-0255/01/$ - see front matter Ó 2001 Elsevier Science Inc. All rights reserved. PII: S 0 0 2 0 - 0 2 5 5 ( 0 1 ) 0 0 0 7 9 - 2
102
Manuel Gra~na / Information Sciences 133 (2001) 101±102
biased conditional cooperation strategy as a means to enforce cooperation between individuals and convergence to diversity preserving populations. H. Timucin Ozdemir and C.K. Mohan deal with a combinatorial problem in most classical tradition of genetic algorithms (GA): the crew scheduling. Y.S. Yeun et al., employ genetic programming (GP) trees for smooth ®tting of curves and contribute a new method to determine the regularization parameter to be used in the selection of GP trees. H. Fr ohlich et al., dealt with another combinational problem, that of ®nding the maximum common subgraph, with an interesting application in the design of ®eld programmable gate arrays (FPGA). A.F. Sheta and K. De Jong apply GA tune the radial basis function parameters with a promising application to time series prediction. S. Tsutsui and D.E. Goldberg give an analysis of boundary extension methods proposed to cope with the closing of crossover operators in GA with real valued individuals given by a real valued codi®cation. A.I. Gonzalez et al., present the results of applying an evolutionary adaptation strategy to the computation of image codebooks used for the posterior image ®ltering and segmentation. Finally, A.L. Buczak et al. presents an interesting application to the automatic optimization of sensor networks. I am grateful to Dr. Goldberg for his guidance and support during the building up of the workshop, to my co-chairs Richard Duro and Alicia d'Anjou for their work, support and advice, and to Dr. Wang for giving me the opportunity to collaborate in this exciting workshop form the organization side. Also Mrs. Anna Menzies has been a great support and made all things go smooth. Finally, my heartfelt thanks to the members of the program committee whose contributed time and knowledge made possible the distinguished academic level of presentations at the workshop. Jarmo Alander (Univ. Vaasa, Finland), Thomas Baeck (Dortmund, Germany) Anna L. Buczak (AlliedSignal), Stefano Cagnoni (Univ. Parma, Italy), Fulvio Corno (Politecnico di Torino, Italy), Marie Cottrell (Univ. Paris 1, France), Alicia d' Anjou (Univ. Pais Vasco, Spain), Berna Dengiz (Gazi Univ., Turkey), Gerry V. Dozier (Auburn Univ. USA), Richard Duro (Univ. A Coru~ na, Spain), Hillol Kargupta (WSU, USA), Han-gyoo Kim (Hongik, Korea), Evelyne Lutton (INRIA, France), Bernard Manderick (Free Univ. of Brussels, Belgium), John McCall (UK), Zbigniew Michalewicz (Univ. North Carolina, USA), Jae C.Oh (Univ. of Pittsburgh, USA), Andres Perez-Uribe (Swiss Federal Institute of Technology-Lausanne), Jennifer L. Pittman (Penn State Univ. USA), Marc Schoenauer (CMA ± Ecole Polytechnique, Palaiseau, France), George D Smith (Univ. East Anglia, UK), Robert Smith (UWE, UK), Peter Stavroulakis (Telecommunication Systems Institute, Creete, Greece), Hideaki Suzuki (ATR, Japan) Hideyuki Takagi (Kyushu Institute of Design, Japan), Shigeyoshi Tsutsui (Hannan Univ., Japan), J. Luis Verdegay (Univ. Granada, Spain), David Wolpert (NASA Ames Research Center, USA), Xin Yao (Univ. of Birmingham, UK), Yun Seog Yeun (Daejin Jin U. Korea), Zhang Yunfeng (Nat. Univ. Singapore, Singapore).