Towards hybrid evolutionary algorithms

International Transactions in Operational Research

Volumn 6, Issue 6, 1999, Pages 557-570

  Preux, P ^a   Talbi, E G ^a  

^a UNIVERSITÉ DU LITTORAL CÔTE D OPALE   (France)

Author keywords

Combinatorial optimization; Evolutionary algorithms; Genetic algorithms; Hybrid algorithms; Parallel meta heuristics

Indexed keywords

EID: 0038311446     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.1999.tb00173.x     Document Type: Article

References (36)

1. Bachelet, V., Hafidi, Z., Preux, Ph, Talbi. E-G., 1998. Vers la coopération de métaheuristiques parallèles. Calculateurs Parallèles, Réseaux et Systèmes Répartis 10(2), 211-223.
2. Bachelet, V., Preux, Ph, Talbi, E-G., 1996. In: Parallel optimization colloquium POC96. Versailles, France.
3. Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y., Taillard, E., 1995. A parallel tabu search heuristic for the vehicle routing problem with time windows. In: RR CRT-95-84. Centre de Recherche sur les Transports, Université de Montréal, 1995.
4. Brown, D.E., Huntley, C.L., Spillane, A.R., 1989. A parallel genetic heuristic for the quadratic assignment problem. In: Proc. of the Third Int. Conf. on Genetic Algorithms. San Mateo, USA, pp. 406-415.
5. Chu, PC., 1997. A genetic algorithm approach for combinatorial optimization problems. Ph.D. thesis, University of London.
6. Crainic, T.G., Nguyen, A.T., Gendreau, M., 1997. Cooperative multi-thread parallel tabu search with evolutionary adaptive memory. In: 2nd Int. Conf. Metaheuristics. Sophia Antipolis, France.
7. Dorigo, M., Gambardella, L., 1997. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. on Evolutionary Computation 1 (1).
8. Duvivier, D., Preux, Ph., Talbi, E.-G., 1996. Climbing-up N P-hard Hills. In: Voigt, Hans-Michael, Ebeling, Werner, Rechenberg, Ingo, Schwefel, Hans-Paul (Eds.), Parallel problem solving from nature (PPSN'96), vol. 1141. Springer-Verlag, Lecture Notes in Computer Science, pp. 574-583.
9. Esbensen, H., 1994. A macro-cell global router based on two genetic algorithms. In: Proc. of the European Design Automation Conference, pp. 428-433.
10. Fleurent, C.C., Ferland, J.A., 1994. Genetic hybrids for the quadratic assignment problem. DIMACS Ser. Discrete Math. 16, 173-188.
11. Fleurent, C.C., Ferland, J.A., 1995. Genetic and hybrid algorithms for graph coloring. In: Annals of operation research.
12. Fonlupt, C., Robilliard, D., Preux, Ph., 1997. A comparison of the 2-opt-move and the city-swap operators for the TSP. In: Proc. Evolution Artificielle. Nimes, France.
13. Fonlupt, C., Robilliard, D., Preux, Ph., Talbi, E.-G., 1999. Fitness landscape and performance of meta-heuristics. In: Voss, S., Martello, S., Osman, I. (Eds.), Meta-heuristics-Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Press, Ch. 18, pp. 255-266.
14. Fréville, A., Plateau, G., 1986. Heuristics and reduction methods for multiple constraint 0-1 linear programming problems. Eur. J. Oper. Res. 24, 206-215.
15. Hertz, A., Jaumard, B., Ribeiro, C.C., Formosinho, W.P., 1994. Local optima topology for the k-coloring problem. Discrete Appl. Math. 49, 257-280.
16. Karp, R., 1977. Probabilistic analysis of partitioning algorithms for the traveling salesman in the plane. Math. Oper. Res. 2, 209-224.
17. Kirkpatrick, S., Toulouse, G., 1985. Configuration space analysis of travelling salesman problems. J. Phys. 46, 1277-1292.
18. Levine, D., 1994. Parallel genetic algorithms for the set partioning problem. Ph.D. thesis, Argonne National Laboratory, Maths and Computer Science Division, Report ANL 94/23.
19. Lin, F.T., Kao, C.Y., Hsu, C.C., 1991. Incorporating genetic algorithms into simulated annealing. In: Proc. of the Fourth Int. Symp. on AI, pp. 290-297.
20. Mahfoud, S.W., Goldberg, D.E., 1995. Parallel recombinative simulated annealing: a genetic algorithm. Parallel Comp. 21, 1-28.
21. Mitchell, M., 1996. An Introduction to Genetic Algorithms. A Bradford book series, MIT Press.
22. Osman, I.H., Laporte, G., 1996. Metaheuristics: a bibliography. Ann. Oper. Res. 63, 513-628.
23. Porto, C.S., Ribeiro, C., 1996. Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints. J. Heuristics 1 (2), 207-223.
24. Preux, Ph, Robilliard, D., Fonlupt, C., 1997. Fitness landscapes of combinatorial problems and the performance of local search algorithms. Technical Report LIL-97-13, Laboratoire d'Informatique du Littoral, Calais, France, submitted for publication.
25. Preux, Ph., 1994. Étude de l'uniformisation de la population des algorithmes génétiques. In: Alliot, J.-M., Lutton, E., Ronald, E., Schoenauer, M. (Eds.), Actes de Évolution Artificielle'94. Cépaduès, Toulouse, France, pp. 19-28.
26. Rawlins, G.J.E. (Ed.), 1991. Workshop on the foundations of genetic algorithm and classifier, Bloomington, IN, USA. Morgan Kaufmann, San Mateo, CA, USA.
27. Rayward-Smith, V.J., Osman, I.H., Reeves, C.R., Smith, G.D. (Eds.), 1996. Modern heuristic search methods. John Wiley and Sons.
28. Reeves, C.R. (Ed.), 1995. Modern heuristic techniques for combinatorial problems. Advanced topics in computer science. McGraw Hill.
29. Schaffer, J.D. (Ed.), 1989. Proc. of the Third International Conference on Genetic Algorithms, Bloomington, IN, USA. Morgan Kaufmann, San Mateo, CA, USA.
30. Schwefel, H.-P., Männer, R. (Eds.), 1991. Proc. of the First Parallel Problem Solving in Nature, Lecture Notes in Computer Science, vol. 496. Springer-Verlag, Berlin.
31. Stein, D.L. (Ed.), 1989. In: 1988 lectures in complex systems. SFI Studies in the science of complexity, lectures, vol. I. Santa Fe Institute Studies in the Sciences of Complexity. Addison-Wesley Publishing Company (ISBN: 0-201-52015-4).
32. Talbi, E.G., 1995. Chapter: Algorithmes génétiques parallèles: techniques et applications. In: Parallélisme et applications irrégulières. Hermes, France, pp. 29-48.
33. Talbi, E.G., Hafidi, Z., Geib, J.-M., 1999. Parallel adaptive tabu search for large optimization problems. In: Voss, S., Martello, S., Osman, I. (Eds.), Meta-heuristics-Advances and Trends in Local search Paradigms for Optimization. Kluwer Academic Press, pp. 345-358.
34. Talbi, E.G., Muntean, T., Samarandache, I., 1994. Hybridation des algorithmes génétiques avec la recherche tabou. In: Evolution Artificielle EA94. Toulouse, France, September.
35. Wright, S., 1932. The roles of mutation, inbreeding, crossbreeding and selection in evolution. In: Proc. 6th Congress on Genetics, volume. 1, pp. 356-366.
36. Yamada, T., Reeves, C., 1997. Permutation flowshop scheduling by genetic local search. In: 2nd IEE/IEEE International Conference on Genetic Algorithms In Engineering Systems: Innovations and Applications. Glasgow, UK, 1997.