Design of Evolutionary Algorithms and Applications in Surface Reconstruction

Evolutionary algorithms are a class of direct search methods. They can be used whenever classical optimization methods do not yield satisfactory results. In the following we discuss the design of problem-specific evolutionary algorithms. We present a technique for the systematic integration of domain knowledge. Surface reconstruction by means of evolutionary algorithms serves as a practical example. For this problem the integration of domain knowledge is essential for a successful application of evolutionary algorithms.

[1]  Ulrich Hammel,et al.  Optimization of Heat Exchanger Networks by Means of Evolution Strategies , 1996, PPSN.

[2]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[3]  Francis Schmitt,et al.  Surface Reconstruction from Unstructured 3D Data , 1996, Comput. Graph. Forum.

[4]  Michael T. M. Emmerich,et al.  Design of Graph-Based Evolutionary Algorithms: A Case Study for Chemical Process Networks , 2001, Evolutionary Computation.

[5]  Sándor P. Fekete,et al.  Area optimization of simple polygons , 1993, SCG '93.

[6]  Dirk Wiesmann,et al.  Metric Based Evolutionary Algorithms , 2000, EuroGP.

[7]  Demetri Terzopoulos,et al.  Sampling and reconstruction with adaptive meshes , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[8]  Joseph C. Culberson,et al.  On the Futility of Blind Search: An Algorithmic View of No Free Lunch , 1998, Evolutionary Computation.

[9]  David B. Fogel,et al.  A note on representations and variation operators , 1997, IEEE Trans. Evol. Comput..

[10]  Frank Kursawe,et al.  Grundlegende empirische Untersuchungen der Parameter von Evolutionsstrategien - Metastrategien , 1999 .

[11]  A. Krone,et al.  A hybrid evolutionary search concept for data-based generation of relevant fuzzy rules in high dimensional spaces , 1999, FUZZ-IEEE'99. 1999 IEEE International Fuzzy Systems. Conference Proceedings (Cat. No.99CH36315).

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Baining Guo,et al.  Local shape control for free-form solids in exact CSG representation , 1996, Comput. Aided Des..

[14]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[15]  Hans-Georg Beyer,et al.  Local performance of the (1 + 1)-ES in a noisy environment , 2002, IEEE Trans. Evol. Comput..

[16]  David B. Fogel,et al.  Evolution-ary Computation 1: Basic Algorithms and Operators , 2000 .

[17]  Hans-Georg Beyer,et al.  Local Performance of the (μ/μ, μ)-ES in a Noisy Environment , 2000, FOGA.

[18]  L. Darrell Whitley,et al.  Changing Representations During Search: A Comparative Study of Delta Coding , 1994, Evolutionary Computation.

[19]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[20]  Rajkumar Roy,et al.  Advances in Soft Computing: Engineering Design and Manufacturing , 1998 .

[21]  XI FachbereichInformatik Finite Markov Chain Results in Evolutionary Computation: a Tour D'horizon , 1998 .

[22]  Bernhard Sendhoff,et al.  A Condition for the Genotype-Phenotype Mapping: Causality , 1997, ICGA.

[23]  L. Schumaker,et al.  Surface Fitting and Multiresolution Methods , 1997 .

[24]  Peter Stagge,et al.  Averaging Efficiently in the Presence of Noise , 1998, PPSN.

[25]  Peter S. Pacheco Parallel programming with MPI , 1996 .

[26]  Mounib Mekhilef,et al.  Optimization of a representation , 1993, Comput. Aided Des..

[27]  J. Mehnen,et al.  A Comparison of Point Data Selection Schemes for Evolutionary Surface Reconstructions , 2001 .

[28]  Stephen Todd,et al.  Evolutionary Art and Computers , 1992 .

[29]  Karsten Weicker,et al.  Burden and Benefits of Redundancy , 2000, FOGA.

[30]  Xin Yao,et al.  Fast Evolution Strategies , 1997, Evolutionary Programming.

[31]  Kumar Chellapilla,et al.  Evolving computer programs without subtree crossover , 1997, IEEE Trans. Evol. Comput..

[32]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: Some Asymptotical Results from the (1,+ )-Theory , 1993, Evolutionary Computation.

[33]  Jörn Mehnen,et al.  Evolutionary surface reconstruction using CSG-NURBS-hybrids , 2001 .

[34]  Stefan Droste,et al.  On the design of problem-specific evolutionary algorithms , 2003 .

[35]  T. Back,et al.  Thresholding-a selection operator for noisy ES , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[36]  Dirk Wiesmann Mutation Operators for the Evolution of Finite Automata , 2001 .

[37]  Lyuba Alboul,et al.  Polyhedral metrics in surface reconstruction: tight triangulations , 1995 .

[38]  H. Beyer Evolutionary algorithms in noisy environments : theoretical issues and guidelines for practice , 2000 .

[39]  Hans-Georg Beyer,et al.  The Theory of Evolution Strategies , 2001, Natural Computing Series.

[40]  P. Davies,et al.  Local Extremes, Runs, Strings and Multiresolution , 2001 .

[41]  Günter Rudolph,et al.  Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon , 1998, Fundam. Informaticae.

[42]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[43]  Klaus Weinert,et al.  Reconstruction of particle flow mechanisms with symbolic regression via genetic programming , 2001 .

[44]  Sandor Markon,et al.  Threshold selection, hypothesis tests, and DOE methods , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[45]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[46]  Zbigniew Michalewicz,et al.  Evolutionary Computation 2 , 2000 .

[47]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[48]  Markus Schneider,et al.  Evolutionary Optimization of Approximating Triangulations for Surface Reconstruction from Unstructured 3D Data , 2002, JCIS.

[49]  Sabine Roth-Koch Merkmalsbasierte Definition von Freiformgeometrien auf der Basis räumlicher Punktwolken , 1996 .

[50]  Paul Halpern Evolutionary Algorithms on a Self-Organized, Dynamic Lattice , 2003 .

[51]  Peter J. Bentley,et al.  Evolutionary Design By Computers , 1999 .

[52]  Sandor Markon Studies on applications of neural networks in the elevator system , 1996 .

[53]  Thomas Bäck,et al.  Evolutionary Algorithms in Theory and Practice , 1996 .

[54]  Frank Albersmann Aufbereitung von 3D-Digitalisierdaten , 1997, Effiziente Methoden der geometrischen Modellierung und der wissenschaftlichen Visualisierung.

[55]  Subhash Suri,et al.  Surface approximation and geometric partitions , 1994, SODA '94.

[56]  Peter J. Denning,et al.  Machines, Languages, And Computation , 1978 .

[57]  Les A. Piegl,et al.  The NURBS Book , 1995, Monographs in Visual Communication.

[58]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[59]  Gábor Renner,et al.  Genetic algorithms in free form curve design , 1995 .

[60]  Reinhard Männer,et al.  Tackling the Representation Problem by Stochastic Averaging , 1997, ICGA.

[61]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[62]  Wolfgang Christian,et al.  Thermal and Statistical Physics Simulations , 1995 .

[63]  Joachim Sprave,et al.  Ein einheitliches Modell für Populationsstrukturen in Evolutionären Algorithmen , 1999 .

[64]  Rüdiger Zarnekow,et al.  Intelligent Software Agents , 1998, Springer Berlin Heidelberg.

[65]  D T Pham,et al.  A Genetic Algorithm Based Preliminary Design System , 1993 .

[66]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[67]  Joachim Hornegger,et al.  Pattern Recognition and Image Processing in C++ , 1995, Vieweg+Teubner Verlag.

[68]  Jörn Mehnen,et al.  New Solutions for Surface Reconstruction from Discrete Point Data by Means of Computational Intelligence , 1998 .

[69]  U. Fischer Müller, M. W., Approximationstheorie. Studienbuch für Studierende der Mathematik, Physik und Informatik ab 3. Semester. Wiesbaden, Akademische Verlagsgesellschaft 1978. 247 S , 1979 .

[70]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[71]  Günter Rudolph,et al.  Dynamic Neighborhood Structures in Parallel Evolution Strategies , 2001, Complex Syst..

[72]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[73]  Paul Jung,et al.  No free lunch. , 2002, Health affairs.

[74]  Joachim Sprave Ease - Evolutionary Algorithms Scripting Environment , 2001 .

[75]  Dirk V. Arnold,et al.  Evolution strategies in noisy environments- a survey of existing work , 2001 .

[76]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[77]  Zbigniew Michalewicz,et al.  Evolutionary Computation 1 , 2018 .

[78]  Ian C. Parmee The Development of a Dual-Agent Strategy for Efficient Search Across Whole System Engineering Design Hierachies , 1996, PPSN.

[79]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[80]  Wolfgang Banzhaf,et al.  Surface Reconstruction from 3D Point Data with a Genetic Programming/Evolution Strategy hybrid , 2001 .

[81]  Jörn Mehnen,et al.  Parallel Surface Reconstruction , 2002, EuroGP.