Genetic Algorithms Digest Thursday, January 13, 1994 Volume 8 : Issue 2 - Send submissions to GA-List@AIC.NRL.NAVY.MIL - Send administrative requests to GA-List-Request@AIC.NRL.NAVY.MIL - anonymous ftp archive: FTP.AIC.NRL.NAVY.MIL (Info in /pub/galist/FTP) Today's Topics: - IlliGAL publication announcements - SAFIER: the SAnta Fe Inst Evol computation Repository project... - Genetic Algorithms in Artificial Intelligence - IEEE World Congress on Computational Intelligence ---------------------------------------------------------------------- **************************************************************************** CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference) EP94 3rd Ann Conf on Evolutionary Programming, San Diego (v7n7) Feb 24-25, 94 IEE94 Colloquium on Molecular Bioinformatics, London, UK (v7n21) Feb 28, 94 SPIE, Neural & Stoch. Methods in Image & Sig Proc, Orlando(v7n18) Apr 5-8, 94 FLAIRS-94 Workshop on Artif Life and AI, Pensacola Beach, FL(v7n23) May 4, 94 The IEEE Conference on Evolutionary Computation, Orlando(v7n26) Jun 26-30, 94 FOGA94 Foundations of GAs Wkshop, Estes Park, Colorado(v7n26)Jul 30-Aug 3, 94 SAB94 3rd Intl Conf on Sim of Adaptive Behavior, Brighton(v7n11) Aug 8-12, 94 ECAI-94, 11th European Conference on AI, Amsterdam (v7n23) Aug 8-12, 94 IEEE/Nagoya Univ WW Wkshp on Fuzzy Logic & NNs/GAs, Japan(v7n33) Aug 9-10, 94 ISRAM94 Special Session on Robotics & GAs, Maui, Hawaii (v7n22) Aug 14-17, 94 COMPLEX94 2nd Australian National Conference, Australia (v7n34) Sep 26-28, 94 PPSN-94 Parallel Problem Solving from Nature, Israel (v7n32) Oct 9-14, 94 (Send announcements of other activities to GA-List@aic.nrl.navy.mil) **************************************************************************** ------------------------------ From: jhorn@gal1.ge.uiuc.edu (Jeff Horn) Date: Sun, 19 Dec 93 14:52:36 CST Subject: IlliGAL publication announcements IlliGAL FTP SERVER and NEW PUBLICATIONS: The Illinois Genetic Algorithms Laboratory (IlliGAL) is pleased to announce the implementation of our new ftp server and the publication of several new papers and technical reports. (1) NEW PUBLICATIONS: The Illinois Genetic Algorithms Laboratory (IlliGAL) is pleased to announce the following reports and publications. Most IlliGAL technical reports, as well as reprints of the other publications, are available in hardcopy and can be ordered from the IlliGAL librarian, Eric Thompson (see below for ordering information). Those papers marked with an asterisk (*) are also available electronically on our new ftp server (see below for ftp instructions). New IlliGAL: IlliGAL Report No 93005* Title: Multiobjective Optimization Using the Niched Pareto Genetic Algorithm Authors: Jeffrey Horn and Nicholas Nafpliotis (NOTE: This final version is significantly enhanced over the draft version that was distributed at ICGA 5 this summer, +10 pages!) ABSTRACT Many, if not most, optimization problems have multiple objectives. Historically, multiple objectives (i.e., attributes or criteria) have been combined ad hoc to form a scalar objective function, usually through a linear combination (weighted sum) of the multiple attributes, or by turning objectives into constraints. The most recent development in the field of decision analysis has yielded a rigorous technique for combining attributes multiplicatively (thereby incorporating nonlinearity), and for handling uncertainty in the attribute values. But MultiAttribute Utility Analysis (MAUA) provides only a mapping from a vector-valued objective function to a scalar-valued function, and does not address the difficulty of searching large problem spaces. Genetic algorithms (GAs), on the other hand, are well suited to searching intractably large, poorly understood problem spaces, but have mostly been used to optimize a single objective. The direct combination of MAUA and GAs is a logical next step for multiobjective GA optimization. However, there is an alternative approach. It turns out that the GA is readily modified to deal with multiple objectives by incorporating the concept of Pareto domination in its selection operator, and applying a niching pressure to spread its population out along the Pareto optimal tradeoff surface. In this report, we discuss the general issues involved in searching large problem spaces while trying to optimize several objectives simultaneously. We explore various combinations of decision analysis techniques, specifically MAUA, and GAs. Finally, we introduce the Niched Pareto GA as an algorithm for finding the Pareto optimal set. We compare and contrast the Niched Pareto GA with MAUA. And we demonstrate the ability of the Niched Pareto GA to find and maintain a diverse ``Pareto optimal population'' on two artificial problems, and an open problem in hydrosystems. Other new publications by IlliGAL staff: ``Making Genetic Algorithms Fly: A Lesson from the Wright Brothers'' David E. Goldberg. ADVANCED TECHNOLOGY FOR DEVELOPERS. Volume 2. February, 1993. pp. 1-8. ``Rapid, Accurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms'' David. E. Goldberg, Kalyanmoy Deb, Hillol Kargupta, and Georges Harik. PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS (ICGA 5), Stephanie Forrest (ed.), Morgan Kaufmann (publ.), 1993, pp. 56-64. ``Finite Markov Chain Analysis of Genetic Algorithms with Niching'' Jeffrey Horn. ICGA 5, pp. 110-117. ``Information Transmission in Genetic Algorithm and Shannon's Second Theorem'' Hillol Kargupta. ICGA 5, p. 640. ``Simple Analytical Models of Genetic Algorithms for Multimodal Function Optimization'' Samir Mahfoud. ICGA 5, p. 643. ``Mixing in Genetic Algorithms'' Dirk Thierens and David E. Goldberg. ICGA 5, pp. 38-45. (2) ANONYMOUS FTP SERVER up and running: GAL4.GE.UIUC.EDU Finally, our server is on-line. Currently available are several IlliGAL technical reports (including the massive GA bibliography, which has been too large for us to mail out hardcopy) and the Messy GA code in C. To access these resources, ftp GAL4.GE.UIUC.EDU login: anonymous password: (your email address) cd /pub/papers/IlliGALs (for reports) cd /pub/src (for messy GA) binary get 93005.ps.Z (for example) bye Then on your machine (for papers): uncompress 93005.ps.Z lpr -P(your postscript queue) 93005.ps Please look at the README files for explanations of what the file names mean. IlliGAL reports are all compressed postscript files. We plan to add more IlliGAL reports and other publications, although we won't be announcing most such additions. Please try to use the server during off-hours (US central time zone) if you can. You can still order hardcopy versions of most IlliGAL publications (including, in particular, those not yet on the ftp server!). Simply request them by IlliGAL number or title from the IlliGAL librarian, Eric Thompson: Internet: library@GAL1.GE.UIUC.EDU Phone: 217/333-2346 Surface mail: Eric Thompson, IlliGAL Librarian Department of General Engineering 117 Transportation Building 104 South Mathews Avenue Urbana, IL 61801-2996 USA When ordering hardcopy, please include your surface mail address! Note that the file ``order.form.ps'' in /pub/papers on the ftp server is the IlliGAL order form and contains a complete listing of all IlliGAL reports and other publications to date, by IlliGAL number, title and author(s). Below is a list of papers currently available on the ftp server. IlliGAL # Title,Author(s) Length 91007 ``Finite Markov Chain Models of an Alternative Selection Strategy for the Genetic Algorithm'' Mahfoud, S. W. 13 pp. (To appear in Complex Systems) 92002 ``Parallel Recombinative Simulated Annealing: a Genetic Algorithm'' 28 pp. Mahfoud, S.W., and Goldberg, D.E. (Short version appeared in proceedings of PPSN 2, pp 301-310) 92007 ``What Makes a Problem Hard for a Classifier System?'' (LCS Workshop Long Abstract)'' Goldberg, D. E., Horn, J., and Deb, K. 6 pp. 92008 ``Genetic Algorithms: A Bibliography'' Goldberg, D. E., Milman, K., and Tidd, C. 83 pp. 92011 ``Research Note: Long Path Problems for Mutation-Based Algorithms'' Horn, J., Goldberg, D. E., and Deb, K. 7 pp. 93001 ``Simple Analytical Models of Genetic Algorithms for Multimodal Function Optimization'' 12 pp. Mahfoud, S. W. (One page summary appeared in proceedings of 5th ICGA, p. 643) 93002 ``Finite Markov Chain Analysis of Genetic Algorithms with Niching'' Horn, J. (Published, see announcement above.) 13 pp. 93005 ``Multiobjective Optimization Using the Niched Pareto Genetic Algorithm'' Horn, J., and Nafpliotis, N. 32 pp. order.form.ps (The IlliGAL order form, which lists all IlliGAL publications to date) 4 pp. -Jeff Jeffrey Horn jeffhorn@uiuc.edu Illinois Genetic Algorithms Laboratory (jhorn@GAL1.GE.UIUC.EDU) University of Illinois at Urbana-Champaign 117 Transporation Building Day Phone: 217/333-2346 104 South Mathews Avenue Fax: 217/244-5705 Urbana, IL 61801-2996 USA ------------------------------ From: publish@baltzer.nl (Laurenz Baltzer) Date: Fri, 10 Dec 1993 08:02:08 +0100 Subject: Genetic Algorithms in Artificial Intelligence After the first issue on Genetic Algorithms in 1992, a second issue will be published in 1994: Volume 10, IV, 1994 GENETIC ALGORITHMS II N. J. Radcliffe, The algebra of genetic algorithms M.D. Vose, A closer look at mutation in genetic algorithms G.J. Koehler, A proof of the Vose-Liepins conjecture K. Deb and D.E. Goldberg, Sufficient conditions for deceptive and easy binary functions Volume 5, No. I, 1992, GENETIC ALGORITHMS IN ARTIFICIAL INTELLIGENCE, Editor G.E. Liepins K.A. De Jong and W.M. Spears, A formal analysis of the role of multi-point crossover in genetic algorithms G.E. Liepins and M.D. Vose, Characterizing crossover in genetic algorithms D.E. Goldberg, Construction of high-order deceptive functions using low-order Walsh coefficients D. Whitley, Deception, dominance and implicit parallelism in genetic search A.E. Nix and M.D. Vose, Modeling genetic algorithms with Markov chains This issue forms part of the Annals of Mathematics and AI, Editor-in-Chief: Martin Charles Golumbic, IBM Israel Scientific Center, Haifa, Israel For more details please contact: publish@baltzer.nl Laurenz Baltzer J.C.Baltzer AG, Science Publishers Asterweg 1A 1031 HL Amsterdam The Netherlands Tel: +31 20 6370061 Fax: +31 20 6323651 E-mail: publish@baltzer.nl ------------------------------ From: Joerg Heitkoetter Date: Mon, 27 Dec 93 19:25:31 +0100 Subject: SAFIER: the SAnta Fe Institute's Evolutionary computation Repository project... Dear EC'ers, I'd like to introduce the newly opened SAnta Fe Institute's Evolutionary computation Repository. It "lives" on SFI's FTP server ftp.santafe.edu, under the "/pub/EC" hierarchy. Pointers to the complete contents of SAFIER, i.e., a concatenation of all its README files is kept in "sfi.santafe.edu:/pub/EC/CONTENTS", and thus should be your first choice to "take-away" from this archive, on your initial visit. A more elaborate handbook, that moreover lists the current CONTENTS in its appendix, entitled "The Navigator's Guide to SAFIER" is available for A4 paper, and US letter size paper as "sfi.santafe.edu:/pub/EC/handbook/safier.ps.gz", and "sfi.santafe.edu:/pub/EC/handbook/safier-US.ps.gz", repectively. Those of you using the World Wide Web information service, can browse SAFIER with an URL pointing to "ftp://sfi.santafe.edu/pub/EC" The following footer, appears at the end of all README files, so please don't get confused while browsing the CONTENTS file: -==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==- Please refer to the toplevel README file sfi.santafe.edu:/pub/EC/README for further explanations. Thanks. -joke -==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==-==- So, here's the top level README file that will explain the rest: --- $Id: sfi.santafe.edu:/pub/EC/README,v 1.1 1993/11/28 16:12:41 joke Exp $ Welcome to _/_/_/ _/ _/_/_/_/ _/_/_/ _/_/_/_/ _/_/_/ _/ _/ _/_/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/_/_/ _/ _/ _/_/_/ _/ _/_/_/ _/_/_/ _/ _/_/_/_/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/_/_/ _/ _/ _/ _/_/_/ _/_/_/_/ _/ _/ The SAnta Fe Institute's Evolutionary computation Repository. INTRODUCTION This directory hierarchy, titled SAFIER, contains a documented collection, i.e., compilation of electronically available resources related to the field of Evolutionary Computation (EC). It is divided into several categories that reflect the current main research paradigms: Genetic Algortihms (GA), Evolution Strategies (ES), Evolutionary Programming (EP), Genetic Programming (GP), and Classifier Systems (CFS). All these specialized sub-hierarchies are completed with a general Evolutionary Algorithm (EA) folder for hybrid or other approaches not contained in the previous list. Electronically available resources in this context means compressed PostScript (cf CONVENTIONS) versions of research papers, and journal articles; publicly available software packages, and test data sets. Moreover, SAFIER provides a place for the FAQ (list of Frequently Asked Questions and their respective answers) of the USENET newsgroup comp.ai.genetic, for easy access between postings, i.e., the 3 ASCII parts, and the PostScript version. CONVENTIONS All folders in the SAFIER hierarchy contain a file, named README, which holds information on all the other files in that particular folder. The addressing scheme for any file in SAFIER is simply the complete path to that file, with the FTP server's symbolic address prepended. E.g. the README that lists all papers in the genetic algorithm section should be refered to as "sfi.santafe.edu:/pub/EC/GA/papers/README" For a general overview refer to "sfi.santafe.edu:/pub/EC/OVERVIEW". The complete contents of SAFIER, i.e. a concatenation of all README files, is available in "sfi.santafe.edu:/pub/EC/CONTENTS" All PostScript and ".tar" files, have been compressed to reduce disk space using the GNU compression utility "gzip". You thus have to use "gunzip" to decompress the files after downloading. For further explanations consult "The Navigator's Handbook to SAFIER" that's available as "sfi.santafe.edu:/pub/EC/handbook/safier.ps.gz" for A4 paper, and "sfi.santafe.edu:/pub/EC/handbook/safier-US.ps.gz" contains an US letter size version. CONTRIBUTIONS Your contributions are always welcome. Send papers, software, etc. via e-mail to the current SAFIER maintainer, preferably including a short (3-4 lines) description, that can just be "dropped" into the appropriate README file. INQUIRIES Inquiries addressing general SFI specific issues, e.g. BBS related infos, should be directed to Scott Yelich . Address everything else related to SAFIER, i.e. suggestions, contributions, corrections to the current SAFIER maintainer: Joerg Heitkoetter c/o Systems Analysis Research Group, LSXI //// Department of Computer Science UNI DO// University of Dortmund ___ //// D-44221 Dortmund \*\\/// Germany \\\\/ ------------------------------ From: zbyszek@mosaic.uncc.edu (Zbigniew Michalewicz) Date: Tue, 7 Dec 93 14:38:18 EST Subject: IEEE World Congress on Computational Intelligence WCCI Special Plenary Symposium: COMPUTATIONAL INTELLIGENCE: IMITATING LIFE at the 1994 IEEE World Congress on COMPUTATIONAL INTELLIGENCE Orlando, FLA * 3 Conferences ICNN FUZZ-IEEE Evolutionary Computation * 1 (Great) Location * 1 Inclusive Registration Orlando, Florida, June 26-July 2, 1993 Sponsored by the IEEE Neural Networks Council For Meeting Information, Contact: Meeting Management 74710.226@COMPUSERVE.COM 1 800 321 MEET FAX 714 752 7444 The Symposium addresses critical and emerging technologies and issues related to biologically, psychologocally and linguistically motivated models that exhibit various facets of compuutational intelligence.The symposium provides a unique forum for cross-fertilization among the areas of neural networks, fuzzy logic and evolutionary computing. The speakers will offer commentary on the freshest and newest ideas evolving from this dynamic field. Attendance is free to all WCCI registrants. SPEAKERS (abstracts of the talks follow): Hans-Paul Schwefel: On the Evolution of Evolutionary Computation Kenneth DeJong: Genetic Algorithms: a 25 Year Perspective Lawrence J. Fogel: Evolutionary Programming in Perspective Lawrence Davis: Genetic Algorithms for Optimization: Three Case Studies Kiroaki Kitano: Beyond AI: The Double Helix of AI and Alife Bernard Manderick: How to Improve GA-performance for Combinatorial Optimization Problems by Analyzing their Fitness Landscape Heinz Muehlenbein: Theory and Applications of the Breeder Genetic Algorithm Ingo Rechenberg: Evolution Strategy David Schaffer: Combinations of Genetic Algorithms with NNs or Fuzzy Systems Henri Prade: Similarity-based Approximate Reasoning Ramon Lopez de Mantaras: Reasoning Under Uncertainty and Learning in Knowledge Based Systems: Imitating Human Problem Solving Behavior Hamid Berenji: Fuzzy Systems that Can Learn Piero P. Bonissone: Fuzzy Logic Controllers: An Industrial Reality Takeshi Yamakawa: A Neo Fuzzy Neuron and Its Applications to System Identification and Expectation of Chaotic Behavior Michio Sugeno: Qualitative Modeling based on Numberical Data and Knowledge Data, and its Application to Control James C. Bezdek: Neural and Fuzzy Models, Pattern Recognition and Computational Intelligance James Keller: Computational Intelligence in High Level Computer Vision: Determining Spatial Relationships Witold Pedrycz: Fuzzy Modelling: Methodology, Algorithms, and Practice Pratap Khedkar: Learning as Adaptive Interpolation in Neural Fuzzy Systems Toshio Fukuda: Fuzzy-Neuro-GA Based Intelligent Robotics Teruo Fujii: Self-Generation of Neural-Net Controller by Training in Natural Environment Tetsuro Yabuta: Learning Control Aspects in Terms of Neuro-control Sigeru Omatu: Learning on Neural-Controllers in Intelligent Control Systems Allen Waxman: Visual Learning of Objects: Neural Models of Shape, Color, Motion and Space Erkki Oja: Unsupervised Learning for Feature Extraction Anil K. Jain: Neural Networks and Pattern Recognition Dave Touretzky: Neural Representations of Space in Rats and Robots Shiro Usui: Computational Color Vision Model by Neural Networks Karen Payton: Status of Auditory Modeling Research and its Relationship to Automatic Speech Recognition Robert Hecht-Nielsen: Neural Network Theory - Early Payoffs and New Challenges John Moody: Neural Networks for Time Series Steven K. Rogers: How Captain Amerika Uses Neural Networks to Fight Crime Rolf Eckmiller: Biology-Inspired Pulse Processing Neural Nets with Adaptive Weights and Delays - Sources from Neuroscience versus Applications in Industry and Medicine Gerald Tesauro: Why Does TD-Gammon Learn So Well? Joseph R. Brown: New Paradigms in Technology Transfer Charles H. Anderson: Neurobiological Computational Systems Robert A. Wiggins: Neural Computing Technology Transfer - A UK Government Programme Francoise Fogelman: Integrating Neural Networks for Real World Applications George Sperling: Visual Preprocessing Russell C. Eberhart: Biomedical Applications of Computational Intelligence [Ed's Note: This message has been shortened due to space constraints. The full message, containing the abstracts of each talk, is available from the ftp server, ftp.aic.nrl.navy.mil in the file /pub/galist/info/conferences/WCCI-imitating-life-94. -- Connie] ------------------------------ End of Genetic Algorithms Digest ******************************