Parallel Genetic Algorithms in Optimization
暂无分享,去创建一个
[1] M. Padberg,et al. Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .
[2] D. Moore. A Round-Robin Parallel Partitioning Algorithm , 1988 .
[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[4] Gregor von Laszewski,et al. Intelligent Structural Operators for the k-way Graph Partitioning Problem , 1991, ICGA.
[5] MARCEL J. E. GOLAY,et al. Sieves for low autocorrelation binary sequences , 1977, IEEE Trans. Inf. Theory.
[6] Marcel J. E. Golay,et al. A new search for skewsymmetric binary sequences with optimal merit factors , 1990, IEEE Trans. Inf. Theory.
[7] Hans-Paul Schwefel,et al. Numerical Optimization of Computer Models , 1982 .
[8] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[9] Marcel J. E. Golay,et al. The merit factor of long low autocorrelation binary sequences , 1982, IEEE Trans. Inf. Theory.
[10] Carsten Peterson,et al. Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem , 1990, Neural Computation.
[11] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[12] Gordon C. Everstine,et al. A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront , 1979 .
[13] Carsten Peterson,et al. A New Method for Mapping Optimization Problems Onto Neural Networks , 1989, Int. J. Neural Syst..
[14] Bernard Manderick,et al. Fine-Grained Parallel Genetic Algorithms , 1989, ICGA.
[15] John R. Gilbert,et al. A parallel graph partitioning algorithm for a message-passing multiprocessor , 1987, International Journal of Parallel Programming.
[16] Heinz Mühlenbein,et al. Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..
[17] Emile H. L. Aarts,et al. Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.
[18] Reiko Tanese,et al. Distributed Genetic Algorithms , 1989, ICGA.
[19] Heinz Mühlenbein,et al. Darwin's Continent Cycle Theory and Its Simulation by the Prisoner's Dilemma , 1991, Complex Syst..
[20] Heinz Mühlenbein,et al. Evolution in Time and Space - The Parallel Genetic Algorithm , 1990, FOGA.
[21] Dana S. Richards,et al. Punctuated Equilibria: A Parallel Genetic Algorithm , 1987, ICGA.
[22] David S. Johnson,et al. Local Optimization and the Traveling Salesman Problem , 1990, ICALP.
[23] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[24] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[25] S. Kirkpatrick,et al. Configuration space analysis of travelling salesman problems , 1985 .
[26] Richard Szeliski,et al. An Analysis of the Elastic Net Approach to the Traveling Salesman Problem , 1989, Neural Computation.
[27] Heinz Mühlenbein,et al. The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..
[28] Qizhong Wang. Optimization by simulating molecular evolution , 1987, Biological Cybernetics.
[29] Heinz Mühlenbein,et al. New solutions to the mapping problem of parallel systems: The evolution approach , 1987, Parallel Comput..
[30] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[31] Martina Gorges-Schleuter,et al. ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.
[32] K. Hoffmann,et al. Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies , 1992 .
[33] W. Vent,et al. Rechenberg, Ingo, Evolutionsstrategie — Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. 170 S. mit 36 Abb. Frommann‐Holzboog‐Verlag. Stuttgart 1973. Broschiert , 1975 .
[34] F. Glover. HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .
[35] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..