Experiences with fine-grained parallel genetic algorithms

Annals of Operations Research

Volumn 90, Issue , 1999, Pages 203-219

  Kohlmorgen, Udo ^a   Schmeck, Hartmut ^a   Haase, Knut ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Combinatorial optimization; Fine grained parallel genetic algorithm; Island model; Neighborhood model

Indexed keywords

EID: 0043140243     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018912715283     Document Type: Article

References (31)

1. J.E. Beasley, An algorithm for solving large capacitated warehouse location problems, European Journal of Operational Research 33(1988)314-325.
2. J. Branke, H.C. Andersen and H. Schmeck, Global selection methods for massively parallel computers, in: Proceedings of the AISB Workshop on Evolutionary Computing,ed. T.C. Fogart, Lecture Notes in Computer Science vol. 1143, Springer, 1996, pp. 175-188.
3. J. Branke, U. Kohlmorgen, H. Schmeck and H. Veith, Steuerung einer Heuristik zur Losgrößenplanung unter Kapazitätsbeschränkungen mit Hilfe eines parallelen genetischen Algorithmus, in: Proceedings Workshop Evolutionäre Algorithmen in Management-Anwendungen, eds. J. Kuhl and V. Nissen, Göttingen, 1995, pp. 21-31.
4. D. Cattrysse, J. Maes and L.N. van Wassenhove, Set partitioning and column generation heuristics for capacitated lotsizing, European Journal of Operational Research 46(1990)38-47.
5. J.P. Cohoon, S.U. Hedge, W.N. Martin and D. Richards, Punctuated equilibria: A parallel genetic algorithm, in: Proceedings of the 2nd International Conference on Genetic Algorithms, ed. J.J. Grefenstette, Lawrence Erlbaum Associates, 1987, pp. 148-154.
6. R.J. Collins and D.R. Jefferson, Selection in massively parallel genetic algorithms, in: Proceedings of the 4th International Conference on Genetic Algorithms, eds. R.K. Belew and L.B. Booker, Morgan Kaufmann, San Diego, CA, 1991, pp. 244-248.
7. P.S. Dixon and E.A. Silver, A heuristic solution procedure for multi-item single-level, limited capacity, lot-sizing problem, Journal of Operations Management 2(1981)23-39.
8. W. Domschke and A. Drexl, Einführung in Operations Research, Springer, Berlin/Heidelberg, 1991.
9. D. Duvivier, P. Preux and E.G. Talbi, Parallel genetic algorithms for optimization and application to NP-complete problem solving, in: International Workshop on Combinatorics and Computer Science, Brest, France, 1995.
10. D. Eichberg, Untersuchung des Insel-Modells genetischer Algorithmen auf einem massiv parallelen Rechner, Diplomarbeit, Institut AIFB, Universität Karlsruhe, 1996.
11. D. Eichberg, U. Kohlmorgen and H. Schmeck, Feinkörnig parallele Varianten des Insel-Modells genetischer Algorithmen, in: Mitteilungen - Gesellschaft für Informatik e. V., Parallel-Algorithmen und Rechnerstrukturen, PARS-Workshop, Stuttgart, Oct. 9-11, 1995, pp. 74-80.
12. T. Fogarty, Implementing the genetic algorithm on transputer based parallel processing systems, in: Parallel Problem Solving from Nature - PPSN I, eds. H.P. Schwefel and R. Männer, Lecture Notes in Computer Science vol. 496, Springer, Berlin, 1991, pp. 145-149.
13. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading MA, 1989.
14. M. Gorges-Schleuter, Explicit parallelism of genetic algorithms through population structures, in: Parallel Problem Solving from Nature, eds. H.P. Schwefel and R. Männer, Springer, Berlin, 1991, pp. 150-159.
15. K. Haase, Capacitated lot-sizing with linked production quantities of adjacent peroids, Technical Report No. 334, Institut für Betriebswirtschaftslehre, Universität Kiel, 1994.
16. K. Haase and U. Kohlmorgen, Parallel genetic algorithm for the capacitated lot-sizing problem, in: Operations Research Proceedings 1995, eds. P. Kleinschmidt et al., Springer, Berlin, 1996, pp. 370-375.
17. Ö. Kirca and M. Kökten, A new heuristic approach for the mult-item dynamic lot sizing problem, European Journal of Operational Research 75(1994)332-341.
18. R. Kolisch, A. Sprecher and A. Drexl, Characterization and generation of a general class of resource constrained project scheduling problems, Management Science 41(1995)1693-1703.
19. B. Kröger, P. Schwenderling and O. Vornberger, Parallel genetic packing on transputers, in: Parallel Genetic Algorithms: Theory and Applications, ed. J. Slender, IOS Press, Amsterdam, 1993, pp. 151-185.
20. B. Manderick and P. Spiessens, Fine-grained parallel genetic algorithms, in: Proceedings of the 3rd International Conference on Genetic Algorithms, ed. J.D. Schaffer, Morgan Kaufmann, San Mateo CA, 1989, pp. 428-433.
21. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, 1996.
22. G. Reinelt, TSPLIB - a traveling salesman problem library, ORSA Journal on Computing 3(1991) 376-384.
23. M. Schwehm, Implementation of genetic algorithms on various interconnection networks, in: Proceedings of the International Conference PACTA, eds. M. Valero et al., IOS Press/CIMNE, 1992, pp. 195-203.
24. M. Schwehm, Th. Oparterny and K.-H. Kirsch, Plazierung von Makrozellen durch genetische Algorithmen auf verteilten und massiv parallelen Rechnern, in: Mitteilungen - Gesellschaft für Informatik e.V., Parallel-Algorithmen und Rechnerstrukturen, Workshop 1994, 1995, pp. 69-74.
25. E. Taillard, Benchmarks for the basic scheduling problems, European Journal of Operational Research 64(1993)278-285
26. E.G. Talbi, P. Bessire, J.M. Ahuactzin and E. Mazer, Parallel cooperating genetic algorithms, in: Practical Handbook of Genetic Algorithms: New Frontiers, ed. L. Chambers, CRC Press, 1995, pp. 93-109.
27. R. Tanese, Distributed genetic algorithms, in: Proceedings of the 3rd International Conference on Genetic Algorithms, ed. J.D. Schaffer, Morgan Kaufmann, San Mateo, CA, 1989, pp. 434-439.
28. U. Tempel, Vergleich lokaler Selektionsstratgien für feinkörnig parallele genetische Algorithmen zur Lösung von schweren Optimierungsproblemen, Diplomarbeit, Institut AIFB, Universität Karlsruhe, 1995.
29. J.M. Thizy and L.N. Van Wassenhove, Lagrangian relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation, HE Transactions 17(1985)308-313.
30. L.D. Whitley, T. Starkweather and D'Ann Fuquay, Scheduling problems and traveling salesman: The genetic edge recombination, in: Proceedings of the 3rd International Conference on Genetic Algorithms, ed. J.D. Schaffe, Morgan Kaufmann, San Mateo, CA, 1989, pp. 133-140.
31. L.D. Whitley and T. Starkweather, Genitor {II}: A distributed genetic algorithm, Expt. Theor. Artif. Intell. 2(1990)189-214.