On complexity of optimal recombination for binary representations of solutions

Evolutionary Computation

Volumn 16, Issue 1, 2008, Pages 127-147

  Eremeev, Anton V ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Complexity; Evolutionary algorithm; Optimal recombination; Optimized crossover

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; EVOLUTION; STATISTICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; EVOLUTION; LINEAR MODELS;

EID: 42449086958     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2008.16.1.127     Document Type: Article

References (26)

1. Aggarwal, C., Orlin, J., and Tai, R. (1997). An optimized crossover for maximum independent set. Operations Research, 45:225-234.
2. Aho, A., Hopcroft, J., and Ullman, J. D. (1974). The design and analysis of computer algorithms. Reading, MA: Addison-Wesley.
3. Alekseeva, E., Kochetov, Y., and Plyasunov, A. (in press). Complexity of local search for the p-median problem. European Journal of Operational Research. Available at doi: 10.1016/ j.ejor.2006.12.063.
4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., and Protasi, M. (1999). Complexity and approximation: Combinatorial optimization problems and their approximability properties. Berlin: Springer Verlag.
5. Balas, E., and Niehaus, W. (1996). Finding large cliques in arbitrary graphs by bipartite matching. In D. Johnson and M. Trick (Eds.), Series in discrete mathematics and theoretical computer science, vol. 26 (pp. 29-49). Sunrise, FL: AMS.
6. Balas, E., and Niehaus, W. (1998). Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. Journal of Heuristics, 4(2):107-122.
7. Borisovsky, P., Dolgui, A., and Eremeev, A. (in press). Genetic algorithms for a supply management problem: MIP-recombination vs. greedy decoder. European Journal of Operational Research. Available at doi: 10.1016/j.ejor.2007.06.060.
8. Cheriyan, J., Cunningham, W., Tuncel, L., and Wang, Y. (1996). A linear programming and rounding approach to MAX-2-SAT. In DIMACS series in discrete mathematics and theoretical computer science, vol. 26 (pp. 395-414).
9. Cotta, C. (2003). A study on allelic recombination. In Proceedings of the 2003 Congress on Evolutionary Computation, pp. 1406-1413.
10. Cotta, C., and Troya, J. M. (2003). Embedding branch and bound within evolutionary algorithms. Applied Intelligence, 18:137-153.
11. Eremeev, A. (1999). A genetic algorithm with a non-binary representation for the set covering problem. In Proceedings of Operations Research (OR'98), pp. 175-181.
12. Garey, M., and Johnson, D. (1979). Computers and intractability. A guide to the theory of NP-completeness. New York: W.H. Freeman and Company.
13. Glover, F., Laguna, M., and Marti, R. (2000). Fundamentals of scatter search and path relinking. Control and Cybernetics, 29(3):653-684.
14. Guruswami, V., Hastad, J., and Sudan, M. (2002). Hardness of approximate hypergraph coloring. SIAM Journal of Computing, 31(6):1663-1686.
15. Hochbaum, D. S. (1997). Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems. In D. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 94-143). Boston: PWS Publishing Company.
16. Hohn, C., and Reeves, C. R. (1996). Graph partitioning using genetic algorithms. In G. R. Sechi (Ed.), Proceedings of the 2nd International Conference on Massively Parallel Computing Systems (pp. 31-38). Piscataway, NJ: IEEE.
17. Holland, J. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press.
18. Jansen, T., and Wegener, I. (2002). On the analysis of evolutionary algorithms - A proof that crossover really can help. Algorithmica, 34(1):47-66.
19. Krarup, J., and Pruzan, P. (1983). The simple plant location problem: Survey and synthesis. European Journal of Operational Research, 12:36-81.
20. Lourenço, H., Paixão, J., and Portugal, R. (2001). Multiobjective metaheuristics for the bus driver scheduling problem. Transportation Science, 35:331-343.
21. Meyers, C., and Orlin, J. B. (2006). Very large-scale neighborhood search techniques in timetabling problems. In Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling PATAT-2006, pp. 36-52.
22. Papadimitriou, C. H., and Steiglitz, K. (1982). Combinatorial optimization: Algorithms and complexity. Englewood Cliffs, NJ: Prentice-Hall.
23. Radcliffe, N. J. (1991). Forma analysis and random respectful recombination. In Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 31-38.
24. Reeves, C. R. (1994). Genetic algorithms and neighbourhood search. In T. Fogarty (Ed.), Evolutionary Computing, AISB Workshop. Selected Papers (pp. 115-130). Berlin: Springer-Verlag.
25. Schuurman, P., and Woeginger, G. (2001). Approximation schemes - A tutorial. (Tech. Rep. Woe65), TU Graz, Austria.
26. Yagiura, M., and Ibaraki, T. (1996). The use of dynamic programming in genetic algorithms for permutation problems. European Journal of Operational Research, 92:387-401.