Genetic Algorithms Digest Tuesday, Jan 11, 2000 Volume 14 : Issue 1 - Do NOT send email or reply to gadistr@aic.nrl.navy.mil - Send submissions (articles) to GA-List@aic.nrl.navy.mil - Send administrative requests (subscribe, unsubscribe, change of address, etc.,) to GA-List-Request@aic.nrl.navy.mil ********************************************************************** You can access back issues, GA code, conference announcements, etc., either through the WWW at http://www.aic.nrl.navy.mil/galist/ or through anonymous ftp at ftp.aic.nrl.navy.mil [132.250.84.25] in /pub/galist. ********************************************************************** Today's Topics: - Moderators' note - GA Digest policies - Re: unsexy algorithms (v13n28) - Re: GAs for Data Network Planning (v13n28) - Formation of a New Society, ISGEC - Using GAs for sorting problems - SOURCE CODE - ISMIS'00 Call for Papers - SAB2000 submission deadline is approaching... ------------------------------------------------------------------------------- CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference) AROB2000 5th Int Symp on Alife and Robotics, Oita, Japan Jan 26-28, 00 (v13n17) ECCS2000 EC and Cognitive Science, Melbourne, Australia Jan 28-29, 00 (v13n23) ISTA2000 Int Conf on Adv in Intel Sys, Canberra, AU Feb 2-4, 00 (v13n9) CIEF2000 1st Int WS on CIEF, Atlantic City, USA Feb 27-Mar 3, 00 (v13n11) FEA2000 3rd Int WS on Frontiers in EA, Atlantic City Feb 27-Mar 3, 00 (v13n18) SAC2000 15th ACM Symp on Applied Comp, Como, Italy Mar 19-21, 00 (v13n16) ACIDCA2000 Int Conf on Artif and Comp Intell, Tunisia Mar 22-24, 00 (v13n29) MICAI2000 Mexican Int Conf on AI, Mexico City, MX Apr 10-14, 00 (v13n13) EuroGP2000 3rd European Conf on GP, Edinburgh, UK Apr 15-16, 00 (v13n19) EVOROBOT2000 3rd Euro WS On Evol Robotics, Edinburgh, UK Apr 17 00 (v13n22) ICES2000 Int Conf on Evolvable Systems, Edinburgh, UK Apr 17-19, 00 (v13n13) OR16 Appl and Science of Comp Intel III, Orlando, FL Apr 24-28, 00 (v13n20) ACDM2000 Adaptive Comp in Design and Manuf, Plymouth, UK Apr 26-28, 00 (v13n9) BioSP3 3rd WS on Bio-Inspired Solns to Para Proc Prob,MX May 1, 00 (v13n21) APGA2000 2nd Asia Pac Conf on GAs and Applications, HK May 3-5, 00 (v13n8) ECNN2000 1st IEEE Symp on Comb of EC/NN, San Antonio, TX May 11-12, 00 (v13n19) ICCS2000 3rd Int Conf on Complex Systems, Nashua, NH USA May 21-26, 00 (v13n28) NC2000 2nd Int ICSC Symp on Neural Computation, Berlin May 23-26, 00 (v13n14) WS2000 7th Viennese WS Opt Ctrl, Dyn Games, & Nonlin Dyn May 24-26, 00 (v13n12) First Robocup Euro Champ, Amsterdam, Netherlands May 28-Jun 2, 00 (v13n29) ECML2000 11th Eur Conf on Machine Learning, Barcelona May 30-Jun 2, 00 (v13n26) WAC2000 8th Int Sym on Robotics with Apps, Maui, Hawaii Jun 11-16, 00 (v13n7) TAINN2000 9th Turkish Symp on AI and NN, Izmir, Turkey Jun 21-23, 00 (v13n28) ICAI2000 Int Conf on Artificial Intelligence, Las Vegas Jun 26-29, 00 (v13n25) EIS2000 2nd Int ICSC Sym on Engr of Intell Sys, UK Jun 29-Jul 2 00 (v13n16) ICML2000 7th Int Conf on Machine Learning, Stanford Jun 29-Jul 2 00 (v13n25) IPMU2000 8th Int Conf on IP and Manag of Uncer, Madrid Jul 3-7, 00 (v13n15) SCE2000 6th Int Conf on Comp in Eco&Fi, Barcelona, Spain Jul 6-8, 00 (v13n28) GECCO2000 Genetic and EC Conference, Las Vegas, NV, USA Jul 8-12, 00 (v13n24) CEC2000 Congress on EC, La Jolla, CA, USA Jul 16-19, 00 (v13n17) FOGA2000 Foundations of GAs, Charlottesville, VA, USA Jul 21-24, 00 (v13n24) IJCNN2000 Int Joint Conf on Neural Networks, Como, Italy Jul 24-27, 00 (v13n23) IAS6 The 6Th Int Conf on Intell Auton Sys, Venice, Italy Jul 25-27, 00 (v13n29) ALIFE VII 7th Int Conf on Artificial Life, Portland, OR Aug 1- 6, 00 (v13n25) PATAT2000 3rd Int Conf Prac & Theor of Auto Timetabling Aug 16-18, 00 (v13n8) ECAI2000 14th Euro Conf on AI, Berlin, Germany Aug 20-25, 00 (v13n26) ANTS2000 2nd Int WS on Ant Algorithms, Brussels, Belgium Sep 8-9, 00 (v13n28) SAB2000 Int Conf on Sim Of Adaptive Behavior, Paris, FR Sep 11-15, 00 (v13n24) IWLCS2000 3rd Int WS on Learning Class Systems, Paris Sep 16, 00 (v13n26) PPSNVI Parallel Problem Solving from Nature, Paris, FR Sep 16-20, 00 (v13n24) ISMIS00 Int Sym Meth for Intell Sys, SS on EC, Charlotte Oct 11-14, 00 (v14n1) RSCTC2000 2nd Int Conf Rough Sets & Cur Trends in Comp Oct 16-19, 00 (v13n26) SEAL2000 3rd Asia-Pac Conf on Sim Evol and Learning Oct 25-27, 00 (v13n25) ICARCV2000 6th Int Conf on Cont/Aut/Rob/Vis, Singapore Dec 6-8, 00 (v13n28) ISI2001 Int Congress on Info Science Innovations, Dubai Mar 20-23, 01 (v13n25) Send announcements of other activities to GA-List@aic.nrl.navy.mil. ------------------------------ Moderators' note: Welcome to the first issue of GA Digest for 2000. We would like to thank you all for your participation in making GA Digest an active and interesting newsletter. This year will be the 14th year of GA Digest and there are currently over 3500 subscribers in our mailing list. As many of those subscribers are redistribution lists, we estimate that the actual readership may be close to 4000. As a reminder, we are including a copy of the GA Digest policies below. Best wishes for the new year! Mitch Potter and Annie Wu ------------------------------ GA DIGEST POLICIES 1) Privacy. The GA Digest email addresses will not be redistributed. 2) Advertisements. It is the policy of GA Digest to not allow advertisements per se, although a simple announcement of a new product or service is allowed. The announcement should have a brief description of the product or service, and a contact point for those that are interested. GA Digest will allow conference announcements and job positions to be posted if relevant to evolutionary computation. 3) Second hand requests. The GA Digest moderators will not honor subscribe requests that are not from that person. GA DIGEST ETIQUETTE AND PROTOCOL 1) Copying GA Digest. Permission is granted to copy GA Digest digests (or parts thereof) for research purposes, as long as these copies are not sold. If you wish to sell copies (or parts thereof), you must obtain permission of the current moderators and all submitters of that material. 2) Protocol. The GA Digest is a forum for informal discussion. Individual submissions (or parts thereof) should not be quoted and cited in text without the permission of the author. If you include private email from another person, please obtain permission from that person. 3) Patience. GA Digest receives a lot of mail, which has to be sifted through carefully. You may see a few digests appear before your message shows up. This happens because the backlog can be large, and because not all topics have the same priority. We urge submitters to be aware of dates, and not send items at the last minute. 4) Appropriateness and Attention to Detail. All submissions to GA Digest should directly pertain to the field of evolutionary computation, be in good taste, and be as concise as possible. We prefer not to perform stylistic editing, so please take the time to format your message neatly using a 80 column page. Please also avoid using dashes as separators since we use them to separate submissions. Also, please be careful to send messages to the correct email address as follows: ga-list@aic.nrl.navy.mil is for submissions to the digest ga-list-request@aic.nrl.navy.mil is for administrative requests Mail sent to gadistr@aic.nrl.navy.mil will not be read by the moderators. For those of you who have a change of email address, please give both your new and OLD address, so we can delete the old address from our database. ------------------------------ Date: Sat, 08 Jan 2000 10:03:27 +0000 From: "Mark C. Sinclair" Subject: Re: unsexy algorithms Dear Chris, In Genetic Algorithms Digest Tuesday, Dec 14, 1999 Volume 13 : Issue 28 you said: > I have a minor (and surely repeated elsewhere) observation. GAs and similar > algorithms are 'sexy' and thus receive a lot of goodwill and effort in > order to make them perform at their best. If the boring, unsexy algorithms > received the same love and attention, perhaps they might also have a chance > to shine. I guess this ties in with the ongoing debate about how to do > 'fair' comparisons between algorithms' performances. Although, to be truthful, as a university researcher one of my motives in investigating particular algorithms is simply that I find them interesting ('sexy' even). I would maintain that the best way to do algorithm comparison is to get researchers who regard different algorithms as 'sexy' to each apply them to common problems. Researchers almost inevitably give their best efforts to developing those algorithms that they have greatest experience in (which are also likely to be those they find most interesting). If a single researcher compares an algorithm that they regard as 'sexy' with one they do not, it's no great surprise if the 'sexy' one wins! After all, they probably know a lot more about their favourite algorithm(s). In my own work, I have tried to apply more than one interesting algorithm to my favourite problems (see http://esewww.essex.ac.uk/~mcs/pubs.html), giving my best efforts to a fair comparison. However, I still tend to compare algorithms that I regard as 'sexy' e.g. GA vs. GP. So far, however, I've not managed to get anyone else with very different interests from mine to actually do competitive work on the same set of problems using their favourite algorithms. Anyone interested? Cheers, Mark C. Sinclair Mark C. Sinclair, MA (Cantab), MSc, CEng, MIEE, MIEEE Lecturer, Electronic Systems Engineering, University of Essex, UK Email: mcs@essex.ac.uk WWW: http://esewww.essex.ac.uk/~mcs ------------------------------ Date: Sat, 08 Jan 2000 10:13:14 +0000 From: "Mark C. Sinclair" Subject: Re: GAs for Data Network Planning Wilson, In Genetic Algorithms Digest Tuesday, Dec 14, 1999 Volume 13 : Issue 28 you said: > I am particularly interested in development of software for solving Data > network Planning problems using GAs. Information or literature on this > particular topic will be greatly appreciated. Thanks in advance. You may be interested in a brief survey of mine on evolutionary computation in telecommunications applications: Sinclair, M.C., Evolutionary Telecommunications: A Summary, Proc. GECCO'99 Workshop on Evolutionary Telecommunications: Past, Present and Future, Orlando, Florida, USA, July 1999, pp.209-212 (available online via http://esewww.essex.ac.uk/~mcs/etppf.html). as well as my published work on the NOMaD software toolset (http://esewww.essex.ac.uk/~mcs/NOMaD.html). Cheers, Mark C. Sinclair Mark C. Sinclair, MA (Cantab), MSc, CEng, MIEE, MIEEE Lecturer, Electronic Systems Engineering, University of Essex, UK Email: mcs@essex.ac.uk WWW: http://esewww.essex.ac.uk/~mcs ------------------------------ Date: Sun, 2 Jan 2000 13:17:26 -0600 From: David Goldberg Subject: Formation of a New Society, ISGEC A few weeks ago, the boards of the International Society for Genetic Algorithms (ISGA) and the Genetic Programming Conference organization voted to permanently merge and form the International Society for Genetic and Evolutionary Computation (ISGEC). The new society will permanently bring together the oldest society in the field of evolutionary computation (ISGA) as well as the two largest conferences in the field. The new society should help bring a greater sense of unity, order, and inclusiveness to the growing field of genetic and evolutionary computation. The purpose of this letter is to briefly explain these recent changes and to invite you to the first conference that will celebrate the new society, the 2000 Genetic and Evolutionary Conference (GECCO-2000) to be held July 8-12, 2000 (Saturday-Wednesday) in Las Vegas, Nevada USA. GECCO-99 attracted 619 attendees. We anticipate that GECCO-2000 will again be the place to personally talk with and hear the largest group of researchers and practitioners in the field. The paper submission deadline for GECCO-2000 is January 26, 2000. The new society is named to reflect our intention to embrace all facets of our growing field, including genetic algorithms, genetic programming, evolution strategies, evolutionary programming, classifier systems, evolvable hardware, and emerging areas including (but not limited to) immune system learning, DNA and molecular computing, ant optimization, evolutionary robotics, ECHO, Tierra, and genetic scheduling. The new society and its annual GECCO conference are dynamically structured so as to continuously and automatically embrace new directions of research and new participants in the field. The executive board of the new society brings together the preexisting 9-member board of the International Society for Genetic Algorithms with six additional members (see list below). Its members will be elected annually with staggered terms. In addition, three new councils have been established: the Council of Authors, the Council of Editors, and the Council of Conferences. These councils consist of those who write full-length books, edit journals or books in the field, and run conferences or workshops. These councils should lead to better coordination of conference schedules, advance the intellectual state of our field, and increase the public visibility of our field to the general scientific community. Eligibility for membership in the councils (which is voluntary) is spelled out in detail in the ISGEC bylaws. A list of those who have already signed on to join these councils is found below. ISGEC will be a formal membership society. Special arrangements have been negotiated to provide the two journals Evolutionary Computation and Genetic Programming and Evolvable Machines to all members as part of their membership. Society members will also get a significant discount at society conferences and workshops, such as GECCO and FOGA. The easiest and most cost-effective way to join the new ISGEC is to plan to attend the 2000 Genetic and Evolutionary Computation Conference to be held in Las Vegas, NV, July 8-12, 2000 (Saturday-Wednesday). The GECCO-2000 conference registration form will have a check-off box for joining ISGEC. Those who join will be eligible for a deep discount on their conference registration fee. The discount will be almost enough to pay for the dues themselves. This, together with a subscription to two important journals in the field, will be a very attractive offer. Additional information about ISGEC will be available shortly at www.isgec.org. Additional information about GECCO-2000 is at www.genetic-algorithm.org. Come join us to celebrate the establishment of the first formal membership organization that embraces the whole field of genetic and evolutionary computation. Sincerely, David E. Goldberg ISGEC Chair deg@uiuc.edu ISGEC Executive Board David E. Goldberg, University of Illinois - Urbana-Champaign (Chair) David Andre, University of California - Berkeley Wolfgang Banzhaf, University of Dortmund Kalyanmoy Deb, Indian Institute of Technology - Kanpur Kenneth A. DeJong, George Mason University Terence C. Fogarty, Napier University Erik Goodman, Michigan State University John H. Holland, University of Michigan Hitoshi Iba, University of Tokyo John R. Koza, Stanford University Una-May O'Reilly, Massachusetts Institute of Technology Marc Schoenauer, Ecole Polytechnique Hans-Paul Schwefel, University of Dortmund Lee Spector, Hampshire College Darrell Whitley, Colorado State University Council of Authors (as of December 23, 1999) David Andre Vladan Babovic Wolfgang Banzhaf Forrest H Bennett III Runwei Cheng David A. Coley Michael Conrad Marco Dorigo Rolf Drechsler Emanuel Falkenauer Mitsuo Gen Andreas Geyer-Schulz David E. Goldberg John H. Holland Hitsoshi Iba Christian Jacob Robert E. Keller John R. Koza Dr. Sam Kwong Dirk C. Mattfeld Zbigniew Michalewicz Melanie Mitchell Frederick E. Petry Liz Rudnick Wallace K. S. Tang Adrian Thompson Michael D. Vose Man Leung Wong Council of Editors (as of December 23, 1999) Wolfgang Banzhaf Peter J. Bentley Lance D Chambers Dipankar Dasgupta Francisco Herrera Eric Michielssen Witold Pedrycz Yahya Rahmat-Samii Lee Spector Jose L. Verdegay Darrell Whitley Council of Conferences (as of December 23, 1999) Stefano Cagnoni (EvoIASP 2000) David Corne (EvoTel 2000) Terence C. Fogarty (FOGA 2000) Cyril Fonlupt (Evolution Artificielle) Takashi Gomi (ER 2000) Kin Keung Lai (APGA-2000) Pier Luca Lanzi (EvoRobot2000) I.C. Parmee (ACDM IV) George D. Smith (EvoTel 2000) Adrian Stoica (EH 99) ------------------------------ Date: Mon, 03 Jan 2000 06:55:04 PST From: "aaron yue" Subject: Re : Using GAs for sorting problems I am hoping to do a research paper on sorting using GAs. There seemed to b a lack of literature on sorting involving GAs. So far, the only papers that i have found are from Kenneth E. Kinear. I hope to have more books, articles, papers on this subject. Any help given would be very much appreciated. ------------------------------ Date: Wed, 05 Jan 2000 13:43:19 -0500 From: Mario Naranjo Subject: SOURCE CODE I NEED SOURCE CODE IN C++, SMALLTALK, JAVA OF APPLICATIONS OF GENETIC ALGHORITMS. THANK YOU. ------------------------------ Date: Wed, 05 Jan 2000 16:57:05 -0800 From: "Zbigniew W. Ras" Subject: ISMIS'00 Call for Papers Call for Papers ISMIS'00 SPECIAL SESSION ON EVOLUTIONARY COMPUTATION Charlotte, N.C., October 11-14, 2000 Papers for this special session should be submitted to: Dr. Zbigniew Michalewicz Department of Computer Science University of North Carolina Charlotte, NC 28223 e-mail: zbyszek@uncc.edu IMPORTANT DATES Submission of Papers: March 1, 2000 Acceptance Notification: May 15, 2000 Final Paper: June 30, 2000 Complete information about ISMIS'00 symposium can be found on http://www.coe.uncc.edu/~ras/call00.html ------------------------------ From: "Jean-Arcady Meyer" Date: Fri, 7 Jan 2000 12:05:37 +0100 Subject: SAB2000 submission deadline is approaching... CONFERENCE ANNOUNCEMENT AND CALL FOR PAPERS FROM ANIMALS TO ANIMATS THE SIXTH INTERNATIONAL CONFERENCE ON THE SIMULATION OF ADAPTIVE BEHAVIOR (SAB2000) An International Conference organized by The International Society for Adaptive Behavior (ISAB)), in cooperation with the Chair of Physiology of the Coll=E8ge de France. 11 - 15 September 2000, Paris, France The objective of this interdisciplinary conference is to bring together researchers in computer science, control, artificial intelligence, robotics, neurosciences, ethology, and related fields so as to further our understanding of the behaviors and underlying mechanisms that allow natural and artificial animals to adapt and survive in uncertain environments. The conference will focus on well-defined models - --- robot models, computer simulation models, mathematical models --- to help characterize and compare various organizational principles or architectures underlying adaptive behavior in real animals and synthetic agents, the animats. In addition, there will be sessions on psychological issues, on the one hand, and on industrial applications, on the other, of animat research. Contributions treating any of the following topics from the perspective of adaptive behavior will receive special emphasis: - - Perception and motor control - Neural correlates of behavior - - Motivation and emotion - Action selection - - Learning and development - Evolutionary approaches - - Emergent structures and behaviors - Internal models and representation - - Collective and social behavior - Characterization of environments - - Philosophical and psychological issues - Applied adaptive behavior - - Autonomous robots - Software agents and virtual creatures Authors should make every effort to suggest implications of their work for both natural and artificial animals. Papers that do not deal explicitly with adaptive behavior will be rejected. Conference Chairs * Jean-Arcady Meyer, Laboratoire d'Informatique de Paris 6, jean-arcady.meyer@lip6.fr * Alain Berthoz, Coll=E8ge de France, aber@ccr.jussieu.fr * Dario Floreano, Swiss Federal Institute of Technology, dario.floreano@di.epfl.ch * Herbert Roitblat, University of Hawaii, roitblat@hawaii.edu * Stewart Wilson, Prediction Dynamics, wilson@prediction-dynamics.com Important Dates (2000) FEBRUARY 19: Submissions must be received MARCH 31: Notification of acceptance or rejection (via e-mail) APRIL 30: Camera ready revised versions due SEPTEMBER 11-16: Conference dates General queries to: sab2000@poleia.lip6.fr WWW Page: http://www-poleia.lip6.fr/ANIMATLAB/SAB2000 [ Moderators' note: For full details, please see conference homepage at WWW Page: http://www-poleia.lip6.fr/ANIMATLAB/SAB2000 ] ------------------------------ End of Genetic Algorithms Digest ******************************