Application of random restart to genetic algorithms

Information Sciences

Volumn 95, Issue 1-2, 1996, Pages 81-102

  Ghannadian, Farzad ^a   Alford, Cecil ^a   Shonkwiler, Ron ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES; MULTIPROCESSING SYSTEMS; OPTIMIZATION; RANDOM PROCESSES; SCHEDULING;

MULTIPROCESSOR SYSTEM; RANDOM RESTART;

GENETIC ALGORITHMS;

EID: 0030283133     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(96)00121-1     Document Type: Article

References (19)

1. X. Hu, R. Shonkwiler, and M. C. Spruill, Random restart in global optimization, Preprint 1192-015, School of Mathematics, Georgia Institute of Technology.
2. D. E. Goldberg and P. Segrest, Finite Markov chain analysis of genetic algorithms, in Genetic Algorithms and their Applications: Proc. Second Internat. Conf. on Genetic Algorithms, 1987, pp. 1-8.
3. J. Horn, Finite Markov chain analysis of genetic algorithms with niching, in Proc. Fifth Internat. Conf. on Genetic Algorithms, 1993, pp. 110-117.
4. A. E. Nix and M. D. Vose, Modeling genetic algorithms with Markov chains, Ann. Math. Artif. Intell. 5(1) (1992).
5. E. S. H. Hou, N. Ansari, and H. Ren, A genetic algorithm for multiprocessor scheduling, IEEE Trans. Para. Distrib. Syst. 5(2) (1994).
6. T. Chockalingam and S. Arunkumar, A randomized heuristics for the mapping problem: The genetic approach, Para. Comput. 18:1157-1165 (1992).
7. S. Hurley, Task graph mapping using a genetic algorithm: A comparison of fitness functions, Para. Comput. 19:1313-1317 (1993).
8. F. Ghannadian, R. Shonkwiler, and C. O. Alford, Application of the genetic algorithm to multiprocessor scheduling, in Proc. Internat. Conf. on Parallel and Distributed Processing Techniques and Applications, 1995, pp. 206-215.
9. C. C. Price and M. A. Salama, Scheduling of precedence-constrained tasks on multiprocessors, Computer J. 33(3):219-229 (1990).
10. J. D. Ullman, NP-Complete scheduling problem, J. Comput. Syst. Sci. 10 (1975).
11. M. R. Garey and D. S. Johnson, Computer and Intractability - A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
12. S. Y. Lee and J. K. Aggarwal, A mapping strategy for parallel processing, IEEE Trans. Computers. C-36(4):433-442 (1987).
13. C. Shen and W. H. Tsai, A graph matching approach to optimal task assignment in distributed computing systems using a minmax criterion, IEEE Trans. Computers C-34(3):197-203 (1983).
14. D. L. Isaacson and R. W. Madsen, Markov Chains Theory and Applications, Wiley, New York, 1976.
15. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
16. D. E. Goldberg, Genetic Algorithm in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.
17. L. N. Bhuyan, Q. Yang, and D. P. Agrawal, Performance of multiprocessor interconnection networks, Computer, pp. 25-37 (1989).
18. B. W. Jackson and D. Thoro, Applied Combinatorics with Problem Solving, Addison-Wesley, Reading, MA, 1990.
19. L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.