On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms

Short abstract, isn't it?

[1]  Reiko Tanese,et al.  Distributed Genetic Algorithms , 1989, ICGA.

[2]  Hogg,et al.  Dynamics of computational ecosystems. , 1989, Physical review. A, General physics.

[3]  W. Ebeling,et al.  Boltzmann and Darwin strategies in complex optimization , 1987 .

[4]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

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

[6]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[7]  Larry P. Ritzman.  The Efficiency of Computer Algorithms for Plant Layout , 1972 .

[8]  Werner Ebeling,et al.  Optimization of NP-Complete Problems by Boltzmann-Darwin Strategies Including Life Cycles , 1988 .

[9]  P. Richerson,et al.  The evolution of reciprocity in sizable groups. , 1988, Journal of theoretical biology.

[10]  Donald E. Brown,et al.  A Parallel Genetic Heuristic for the Quadratic Assignment Problem , 1989, ICGA.

[11]  George E. P. Box,et al.  Evolutionary Operation: a Method for Increasing Industrial Productivity , 1957 .

[12]  Bachas,et al.  Invariant geometry of spin-glass states. , 1987, Physical review. B, Condensed matter.

[13]  Philip W. Anderson.  Spin Glass V: Real Power Brought to Bear , 1989 .

[14]  Nulton,et al.  Statistical mechanics of combinatorial optimization. , 1988, Physical review. A, General physics.

[15]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[16]  Nicolas Sourlas,et al.  Spin-glass models as error-correcting codes , 1989, Nature.

[17]  F. Hillier,et al.  Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .

[18]  H. Szu,et al.  Nonconvex optimization by fast simulated annealing , 1987, Proceedings of the IEEE.

[19]  Emile H. L. Aarts,et al.  Parallel implementations of the statistical cooling algorithm , 1986, Integr..

[20]  G. Baskaran,et al.  On the statistical mechanics of the traveling salesman problem , 1986 .

[21]  F. Darema,et al.  Parallel Algorithms for Chip Placement by Simulated Annealing , 1987, IBM J. Res. Dev..

[22]  John C. Platt,et al.  Constraint methods for neural networks and computer graphics , 1990 .

[23]  Hans J. Bremermann,et al.  Quantitative Aspects of Goal-Seeking Self-Organizing Systems* , 1967 .

[24]  Néstor Parga.  Overlap distributions and taxonomy analysis of spin glass states with equal weights , 1987 .

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

[26]  Stuart A. Kauffman,et al.  The origins of order , 1993 .

[27]  C. Lumsden.  Culture and the Evolutionary Process, Robert Boyd, Peter J. Richerson. University of Chicago Press, Chicago & London (1985), viii, +301. Price $29.95 , 1986 .

[28]  David H. Ackley,et al.  An empirical study of bit vector function optimization , 1987 .

[29]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[30]  D. Sherrington,et al.  Graph bipartitioning and statistical mechanics , 1987 .

[31]  L L Cavalli-Sforza,et al.  Theory and observation in cultural transmission. , 1982, Science.

[32]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[33]  P. Anderson,et al.  Application of statistical mechanics to NP-complete problems in combinatorial optimisation , 1986 .

[34]  R. Burkard.  Quadratic Assignment Problems , 1984 .

[35]  Gary S. Grest,et al.  Monte Carlo and mean field slow cooling simulations for spin glasses: relation to NP-completeness , 1987 .

[36]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[37]  P. W. Anderson,et al.  What statistical mechanics has to say to computer scientists , 1986 .

[38]  Reiko Tanese,et al.  Parallel Genetic Algorithms for a Hypercube , 1987, ICGA.

[39]  M W Feldman,et al.  Cultural versus genetic adaptation. , 1983, Proceedings of the National Academy of Sciences of the United States of America.

[40]  Bernard Derrida,et al.  Multivalley structure in Kauffman's model: analogy with spin glasses , 1986 .

[41]  E. Thorndike.  On the Organization of Intellect. , 1921 .

[42]  Elwood S. Buffa,et al.  The Facilities Layout Problem in Perspective , 1966 .

[43]  P. Salamon,et al.  Simulated annealing with constant thermodynamic speed , 1988 .

[44]  W. Krauth,et al.  The Cavity Method and the Travelling-Salesman Problem , 1989 .

[45]  Physics Letters , 1962, Nature.

[46]  Wansoo T. Rhee.  A note on asymptotic properties of the quadratic assignment problem , 1988 .

[47]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[48]  Rajarshi Das,et al.  A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization , 1989, ICGA.

[49]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[50]  Rob A. Rutenbar,et al.  Placement by Simulated Annealing on a Multiprocessor , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[51]  F. S. Hillier,et al.  Quantitative Tools for Plant Layout Analysis , 1963 .

[52]  Ehl Emile Aarts,et al.  Statistical cooling : a general approach to combinatorial optimization problems , 1985 .

[53]  M. Feldman,et al.  Cultural transmission and evolution: a quantitative approach. , 1981, Monographs in population biology.

[54]  Bernard Derrida,et al.  Statistical properties of valleys in the annealed random map model , 1988 .

[55]  E. D. Weinberger,et al.  A more rigorous derivation of some properties of uncorrelated fitness landscapes , 1988 .

[56]  Chrisila C. Pettey,et al.  A Theoretical Investigation of a Parallel Genetic Algorithm , 1989, ICGA.

[57]  Conrad Schneiker,et al.  Nanotechnology with Feynman Machines: Scanning Tunneling Engineering and Artificial Life , 1987, ALIFE.

[58]  Rainer E. Burkard,et al.  The asymptotic probabilistic behaviour of quadratic sum assignment problems , 1983, Z. Oper. Research.

[59]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[60]  Banavar,et al.  Heisenberg and Potts spin glasses: A renormalization-group study. , 1988, Physical review. B, Condensed matter.

[61]  P. Moscato.  A Competitive-cooperative Approach to Complex Combinatorial Search , 1991 .

[62]  M. Mézard,et al.  On the solution of the random link matching problems , 1987 .

[63]  A Piazza,et al.  Reconstruction of human evolution: bringing together genetic, archaeological, and linguistic data. , 1988, Proceedings of the National Academy of Sciences of the United States of America.

[64]  L. Hubert,et al.  Quadratic assignment as a general data analysis strategy. , 1976 .

[65]  A Piazza,et al.  Genetic and linguistic evolution. , 1989, Science.

[66]  Edward W. Felten,et al.  The Traveling Salesman Problem on a Hypercubic, MIMD Computer , 1985, ICPP.

[67]  D. Sherrington,et al.  Graph partitioning and dilute spin glasses: the minimum cost solution , 1988 .

[68]  Banavar,et al.  Chaos in spin glasses: A renormalization-group study. , 1987, Physical review. B, Condensed matter.

[69]  B A Huberman,et al.  Persistence of nonoptimal strategies. , 1989, Proceedings of the National Academy of Sciences of the United States of America.

[70]  Giorgio Parisi,et al.  The Euclidean matching problem , 1988 .

[71]  David E. Goldberg,et al.  Sizing Populations for Serial and Parallel Genetic Algorithms , 1989, ICGA.

[72]  Levin,et al.  Cooling-rate dependence for the spin-glass ground-state energy: Implications for optimization by simulated annealing. , 1986, Physical review letters.

[73]  Eli Gafni,et al.  A Distributed Implementation of Simulated Annealing , 1989, J. Parallel Distributed Comput..

[74]  Richard Durbin,et al.  An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.

[75]  Néstor Parga,et al.  Ultrametricity in the Kauffman model: a numerical test , 1988 .

[76]  A. Tramontano,et al.  Information value and information content in the evolutionary strategy of the genetic code , 1988 .

[77]  Pierre Baldi,et al.  Embeddings of ultrametric spaces in finite dimensional structures , 1987 .

[78]  G. Toulouse,et al.  Ultrametricity for physicists , 1986 .

[79]  H. Sompolinsky,et al.  Graph optimisation problems and the Potts glass , 1987 .

[80]  Rainer E. Burkard,et al.  On random quadratic bottleneck assignment problems , 1982, Math. Program..

[81]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[82]  Giorgio Parisi,et al.  Spin Glass Theory , 1987 .

[83]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[84]  T. Ohta.  A model of evolution for accumulating genetic information. , 1987, Journal of theoretical biology.

[85]  Charles R. Doering,et al.  Mean exit times over fluctuating barriers , 1989 .

[86]  Geoffrey C. Fox,et al.  Monte Carlo physics on a concurrent processor , 1986 .

[87]  W. Richard Stark,et al.  The Social Metaphor for Distributed Processing , 1989, J. Parallel Distributed Comput..

[88]  Bernardo A. Huberman,et al.  The ecology of computation , 1988, Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.

[89]  K. Shoulders.  On microelectronic components, interconnections, and system fabrication , 1960, IRE-AIEE-ACM '60 (Western).

[90]  S C Ji,et al.  Watson-Crick and Prigoginian forms of genetic information. , 1988, Journal of theoretical biology.

[91]  Matsuba.  Optimal simulated-annealing method based on stochastic-dynamic programming. , 1989, Physical review. A, General physics.

[92]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[93]  K. De Jong.  Adaptive System Design: A Genetic Approach , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[94]  R. Brady.  Optimization strategies gleaned from biological evolution , 1985, Nature.

[95]  David E. Goldberg,et al.  Zen and the Art of Genetic Algorithms , 1989, ICGA.

[96]  Wr Jeffrey,et al.  Neural network processing as a tool for function optimization , 1987 .

[97]  Willy Herroelen,et al.  On the use of flow dominance in complexity measures for facility layout problems , 1985 .

[98]  Dana S. Richards,et al.  Punctuated Equilibria: A Parallel Genetic Algorithm , 1987, ICGA.

[99]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[100]  Heinz Mühlenbein,et al.  New solutions to the mapping problem of parallel systems: The evolution approach , 1987, Parallel Comput..

[101]  S. Kauffman,et al.  Towards a general theory of adaptive walks on rugged landscapes. , 1987, Journal of theoretical biology.

[102]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[103]  John J. Grefenstette,et al.  A Parallel Genetic Algorithm , 1987, ICGA.

[104]  Roger C. Vergin,et al.  Comparison of Computer Algorithms and Visual Based Methods for Plant Layout , 1975 .

[105]  Bernard Derrida,et al.  Statistical properties of randomly broken objects and of multivalley structures in disordered systems , 1987 .

[106]  P. Moscato.  On Genetic Crossover Operators for Relative Order Preservation , 1989 .

[107]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[108]  Jean-Luc Lutton,et al.  The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach , 1986 .

[109]  坂倉 省吾,et al.  Technology Review : 抄録雑誌の概要 , 1987 .

[110]  B Grossman.  The origin of the ultrametric topology of spin glasses , 1989 .

[111]  Steven G. Louie,et al.  A Monte carlo simulated annealing approach to optimization over continuous variables , 1984 .

[112]  Wille.  Intractable computations without local minima. , 1987, Physical review letters.

[113]  M. M. Sysło,et al.  Computational experiments with some approximation algorithms for the travelling salesman problem , 1983 .

[114]  David M Stein.  SCHEDULING DIAL-A-RIDE TRANSPORTATION SYSTEMS: AN ASYMPTOTIC APPROACH , 1977 .

[115]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[116]  N. Pierce.  Origin of Species , 1914, Nature.

[117]  Rob A. Rutenbar,et al.  Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.

[118]  R. Boyd.  Mistakes allow evolutionary stability in the repeated prisoner's dilemma game. , 1989, Journal of theoretical biology.

[119]  Dana S. Richards,et al.  Floorplan design using distributed genetic algorithms , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[120]  Andrew B. Whinston,et al.  On Optimal Allocation in a Distributed Processing Environment , 1982 .

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

[122]  K. Adkins.  Theory of spin glasses , 1974 .