Using a set of elite individuals in a genetic algorithm

Proceedings of the International Conference on Information Technology Interfaces, ITI

Volumn , Issue , 2004, Pages 531-535

  Mušnjak, Marko ^a   Golub, Marin ^b  

^a ALSTOM   (France)

^b UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

Elitism; Genetic algorithm; Scheduling; Selection

Indexed keywords

ALGORITHMS; CHROMOSOMES; HEURISTIC METHODS; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PROBABILITY; SCHEDULING; SELECTION;

ACYCLIC GRAPHS; ELITISM; HEURISTIC OPTIMIZATION METHODS; MULTIPROCESSOR SCHEDULING;

GENETIC ALGORITHMS;

EID: 14944363827     PISSN: 13301012     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Ahmad I, Kwok Y-K. On parallelizing the multiprocessor scheduling problem. IEEE Transactions on Parallel and Distributed Systems, 1999; 10(4).
2. Correa R.C., Ferreira A., Rebreyend P, Scheduling multiprocessor task with genetic algorithm. IEEE Transactions on Parallel and Distributed Systems, 1999; 10(8).
3. th IEEE International Conference on Intelligent Engineering Systems; 2001. p. 85-89, available from: http://www.zemris.fer.hr/~golub/clanci.html
4. Golub M., Kasapovic S. Scheduling multiprocessor tasks with genetic algorithms. In: Proceedings of the IASTED International Conference on Applied Informatics; 2002 Feb 18-21; Insbruck, Austria. 2002. p. 273-278, available from: http://www.zemris.fer.hr/~golub/clanci.html
5. Knowles, J. and Corne, D. (1999) The Pareto archived evolution strategy: A new baseline algorithm for multiobjective optimisation. Proceedings of the 1999 Congress on Evolutionary Computation, Piscatway: New Jersey: IEEE Service Center, 98-105.
6. Jung, S.H., Queen-bee evolution for genetic algorithms. IEE Electronic Letters, 2003.
7. Kasahara Laboratory. Advanced Computing Systems, available from: http://www.kasahara.elec.waseda.ac.jp [01/29/2004]
8. Michalewicz Z. Genetic Algorithms + Data Structures = Evolutionary Programs. Berlin: Springer-Verlag; 1992.
9. Munetomo M, Takai Y, Sato Y. An efficient migration scheme for subpopulation-based asynchronous PGA. Technical Report HIER-IS-9301, Hokkaido University Information Engineering, 1993.
10. Talbi E.-G., Bessiere P., A parallel genetic algorithm for the graph partitioning problem. Supercomputing, 1991. p. 312-320.
11. Zomaya A., Ward C., Macey, B., Genetic scheduling for parallel processor systems: Comparative studies and performance issues. IEEE Transactions on Parallel and Distributed Systems, 1999. 10(8).
12. Zitzler, E., Deb, K., and Thiele, L. Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation, 8.
13. Zitzler, E. and Thiele, L. (1998) Multiobjective optimization using evolutionary algorithms - A comparative case study. In Eiben, A. E., B̈ack, T., Schoenauer, M., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature, V, pages 292-301, Springer, Berlin, Germany.