Parallel genetic algorithms with local search

Computers and Operations Research

Volumn 23, Issue 6 SPEC. ISS., 1996, Pages 559-571

  Huntley, Christopher L ^a   Brown, Donald E ^a  

^a University of Virginia   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; OPERATIONS RESEARCH; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES; RESOURCE ALLOCATION; STANDARDS;

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS WITH LOCAL OPTIMIZERS; GLOBAL OPTIMIZATION PROBLEMS; LOCAL SEARCH; PARALLEL GENETIC ALGORITHMS; PARTITIONAL METHODS;

GENETIC ALGORITHMS;

EID: 0030168740     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(95)00061-5     Document Type: Article

References (39)

1. H.-P. Swefel, Evolution and Optimum Seeking. Wiley, New York, NY (1995).
2. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York, NY (1992).
3. J. Holland, Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI (1975).
4. C. Papdimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ (1982).
5. F. Romeo and A. Sangiovanni-Vincentelli, Probabilistic hill climbing algorithms: properties and applications. In Proc. 1985 Chapel Hill Conf. VLSI (Edited by H. Fuchs), pp. 393-417 (1985).
6. S. Geman and D. Geman, Stochastic relaxation, Gibbs distributions, and the restoration of images, IEEE Trans. Pattern Analysis and Machine Intelligence PAMI-6, 721-741 (1984).
7. J. Storer, A. Nicas and J. Becker, Uniform circuit placement. In VLSI: Algorithms and Architectures (Edited by P. Bertolazzi and F. Luccio). Elsevier, Amsterdam.
8. S. Kirkpatrick, C. Gelatt and M. Vecchi, Optimization by simulated annealing. Science 220, 671-680 (1983).
9. C. Huntley, Multiobjective Simulated Annealing for Hierarchical Service Districting Problems. Ph.D. thesis, University of Virginia (1995).
10. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, MA (1984).
11. G. Boender and A. Rinnooy Kan, Bayesian stopping rules for multistart global optimization methods. Mathematical Progr. 37, 59-80 (1987).
12. B. Betro and F. Shoen, Sequential stopping rules for the multistart algorithm in global optimization. Mathematical Progr. 38, 271-286 (1987).
13. H. Muhlenbein, Parallel genetic algorithms and combinatorial optimization. Symposium on Parallel Optimization (No book published) at Madison, WI (1990).
14. A. Rinnooy Kan and G. Timmer, Stochastic global optimization methods. Part I: clustering methods. Mathematical Progr. 39, 27-56 (1987).
15. A. Torn and A. Zilinskas, Global Optimization, Springer, New York, NY (1989).
16. J. Grefenstette (Ed.), Genetic Algorithms and Their Applications: Proc. Second Int. Conf. Genetic Algorithms. Lawrence Erlbaum, Hillsdale, NJ (1987).
17. L. Davis (Ed.), Genetic Algorithms and Simulated Annealing. Morgan Kaufmann, Los Altos, CA (1987).
18. J. Schaffer (Ed.), Proc. Third Int. Conf. Genetic Algorithms. Morgan Kaufmann, San Mateo, CA (1989).
19. D. Goldberg, Optimal population size for binary-coded genetic algorithms. Research report TCGA-85001, University of Alabama (1985).
20. J. Grefenstette, Optimization of control parameters for genetic algorithms. IEEE Trans. Systems, Man, and Cybernetics SMC-16, 122-128 (1986).
21. K. De Jong, An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph.D. thesis, University of Michigan (1975).
22. D. Goldberg and J. Richardson, Genetic algorithms with sharing for multimodal function optimization. In Genetic Algorithms and Their Applications: Proc. Second Int. Conf. Genetic Algorithms, pp. 1-8. Lawrence Erlbaum, Hillsdale, NJ (1987).
23. K. Deb and D. Goldberg, An investigation of niche and species formation in genetic function optimization. In Proc. Third Int. Conf. Genetic Algorithms, pp. 42-50, San Mateo, CA (1989).
24. J. Grefenstette, Parallel adaptive algorithms for function optimization. Research report CS-81-19, Vanderbilt University (1981).
25. C. Pettey, M. Leuze and J. Grefenstette, Genetic algorithms on a hypercube multiprocessor. In Hypercube Multi-processors 1987 (Edited by M. Heath). Siam, Philadelphia, PA (1987).
26. J. Cohoon, S. Hegde, W. Martin and D. Richards, Punctuated equilibria: a parallel genetic algorithm. In Genetic Algorithms and Their Applications: Proc. Second Int. Conf. Genetic Algorithms, pp. 177-183. Lawrence Erlbaum, Hillsdale, NJ (1987).
27. H. Muhlenbein, Parallel genetic algorithms, population genetics, and combinatorial optimization. In Proc. Int. Third Conf. on Genetic Algorithms, pp. 416-422. San Mateo, CA (1989).
28. G. Armour and E. Buffa, A heuristic algorithm and simulation approach to the relative location of facilities. Mgmt. Sci. 9, 294-309 (1963).
29. L. Hubert and J. Schultz, Quadratic assignment as a general data analysis strategy. Brit. J. Math. Statist. Psychol. 29, 190-241 (1976).
30. C. Nugent, R. Vollmann and J. Ruml, An experimental comparison of techniques for the assignment of facilities to locations. Ops Res. 16, 150-173 (1968).
31. D. Goldberg and R. Lingle, Alleles, loci, and the travelling salesman problem. In Proc. Int. Conf. Genetic Algorithms Applications, pp. 154-159 (1985).
32. A. Jain and R. Dubes, Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs, NJ (1988).
33. U. Derigs, Using confidence limits for the global optimum in combinatorial optimization. Ops Res. 33, 1024-1049 (1985).
34. B. Golden and F. Alt, Interval estimation of a global optimum for large combinatorial problems. Naval Res. Logist. Q. 26, 69-77 (1979).
35. A. Elshafei, Hospital layout as a quadratic assignment problem. Ops Res. Q. 28, 167-179 (1977).
36. L. Steinberg, The backboard wiring problem: a placement algorithm. SIAM Rev. 3, 37-50 (1961).
37. W. Press, B. Flannery, S. Teukolsky and W. Vetterling, Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, New York, NY (1988).
38. C. Huntley and D. Brown, A parallel heuristic for quadratic assignment problems. Computers Ops Res. 18, 275-289 (1991).
39. J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem. ORSA J. Computing 2, 33-45 (1990).