Abstract
Evolutionary Computation (EC) is now a few decades old. The impressive development of the field since its initial conception has made it one of the most vigorous research areas, specifically from an applied viewpoint. This should not hide the existence of some major gaps in our understanding on these techniques. In this essay we propose a number of challenging tasks that -according to our opinion- should be attacked in order to fill some of these gaps. They mainly refer to the theoretical basis of the paradigm; we believe that an effective cross-fertilization among different areas of Theoretical Computer Science and Artificial Intelligence (such as Parameterized Complexity and Modal Logic) is mandatory for developing a new corpus of knowledge about EC.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alander, J. (1994). Indexed bibliography of genetic algorithms and neural networks. Technical Report 94-1-NN, University of Vaasa, Department of Information Technology and Production Economics.
Bäck, T., Fogel, D., and Michalewicz, Z. (1997). Handbook of Evolutionary Computation. Oxford University Press, New York NY.
Berretta, R. and Moscato, P. (1999). The number partitioning problem: An open challenge for evolutionary computation ? In Corne, D., Dorigo, M., and Glover, F., editors, New Ideas in Optimization, pages 261–278. McGraw-Hill, Maidenhead, Berkshire, England, UK.
Boldrin, L. and Saffiotti, A. (1999). A modal logic for merging partial belief of multiple reasoners. Journal of Logic and Computation, 9(1):81–103. Online at http://www.aass.oru.se/~asaffio/.
Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1–2): 165–204.
Chen, J., Kanj, I., and Jia, W. (1999). Vertex cover: further observations and further improvements. In Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science, number 1665 in Lecture Notes in Computer Science, pages 313–324. Springer-Verlag.
Coello, Coello, C. A. (1999). An updated survey of evolutionary multiobjective optimization techniques: State of the art and future trends. In Angeline, P. J., Michalewicz, Z., Schoenauer, M., Yao, X., and Zalzala, A., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 3–13, Piscataway, NJ. IEEE Press.
Cotta, C. and Moscato, P. (2003). A mixed evolutionary-statistical analysis of an algorithm’s complexity. Applied Mathematics Letters, 16(l):41–47.
Cotta, C. and Troya, J. (1998). Genetic forma recombination in permutation flowshop problems. Evolutionary Computation, 6(1):25–44.
Culberson, J. (1999). Sokoban is PSPACE-complete. In Lodi, E., Pagli, L., and Santoro, N., editors, Proceedings in Informatics 4, Fun With Algorithms, pages 65–76, Waterloo. Carleton Scientific.
Davidor, Y. (1991). Epistasis variance: A viewpoint on GA-hardness. In Rawlins, G., editor, Foundations of Genetic Algorithms, pages 23–35. Morgan Kaufmann.
Dorigo, M., Maniezzo, V., and Colorni, A. (1996). The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26(1):29–41.
Downey, R. G. and Fellows, M. R. (1995). Fixed parameter tractability and completeness I: Basic theory. SIAM Journal of Computing, 24:873–921.
Downey, R. G., Fellows, M. R., and Stege, U. (1999). Computational Tractability: The View From Mars. Bulletin of the European Association for Theoretical Computer Science, 69:73–97.
Englemore, R. and Morgan, T. (eds.) (1988). Blackboard Systems. Addison-Wesley.
Fellows, M. R. (2002). Parameterized Complexity: The main ideas and connections to practical computing. Electronic Notes in Theoretical Computer Science, 61. available at http://www.elsevier.nl/locate/entcs/volume61.html.
Forrest, S. and Mitchell, M. (1991). What makes a problem hard for a genetic algorithm? some anomalous results and their explanation. In Belew, R. and Booker, L., editors, Proceedings of the 4th International Conference on Genetic Algorithms, pages 182–189, San Mateo, CA. Morgan Kaufman.
Garey, M. and Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of N P-Completeness. W.H. Freeman and Company, San Francisco.
Gent, I. and Walsh, T. (1994). The SAT phase transition. In Cohn, A., editor, Proceedings of 11th European Conference on Artificial Intelligence, pages 105–109. John Wiley & Sons.
Glover, F. and Laguna, M. (1997). Tabu Search. Kluwer Academic Publishers, Boston, MA.
Hansen, P. and Mladenović N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130(3): 449–467.
Hart, W. and Belew, R. K. (1991). Optimizing an arbitrary function is hard for the genetic algorithm. In Belew, R. K. and Booker, L., editors, Proceedings of the 4th International Conference on Genetic Algorithms, pages 190–195, San Mateo CA. Morgan Kaufmann.
Johnson, D., Papadimitriou, C. H., and Yannakakis, M. (1988). How easy is local search? Journal of Computers and System Sciences, 37:79–100.
Kirkpatrick, S., Gelatt Jr., C., and Vecchi, M. (1983). Optimization by simulated annealing. Science, 220(4598):671–680.
Krivelevich, M. (2002). Sparse graphs usually have exponentially many optimal colorings. Electronic Journal of Combinatorics, 9(1):#R27.
Larrañaga, P. and Lozano, J. A., editors (2001). Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Boston.
Lewis, H. and Papadimitriou, C. H. (1998). Elements of the Theory of Computation. Prentice-Hall, Inc., Upper Saddle River, New Jersey.
Mathias, K. and Whitley, D. (1992). Genetic operators, the fitness landscape and the traveling salesman problem. In Männer, R. and Manderick, B., editors, Parallel Problem Solving From Nature II, pages 259–268, Amsterdam. Elsevier Science Publishers B.V.
Moscato, P. (1989). On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Technical Report Caltech Concurrent Computation Program, Report. 826, California Institute of Technology, Pasadena, California, USA.
Moscato, P. (1999). Memetic algorithms: A short introduction. In Corne, D., Dorigo, M., and Glover, F., editors, New Ideas in Optimization, pages 219–234. McGraw-Hill, Maidenhead, Berkshire, England, UK.
Niedermeier, R. and Rossmanith, P. (2000). A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters, 73: 125–129.
Oliver, I., Smith, D., and Holland, J. R. C. (1987). A study of permutation crossover operators on the traveling salesman problem. In Grefenstette, J. J., editor, Proceedings of the 2nd International Conference on Genetic Algorithms, pages 224–230, Hillsdale NJ. Lawrence Erlbaum Associates.
Radcliffe, N. J. and Surry, P. D. (1994). Fitness Variance of Formae and Performance Prediction. In Whitley, D. and Vose, M. D., editors, Proceedings of the 3rd Workshop on Foundations of Genetic Algorithms, pages 51–72, San Francisco. Morgan Kaufmann.
Selman, B., Kautz, H. A., and McAllester, D. A. (1997). Ten challenges in propositional reasoning and search. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI’97), pages 50–54.
Syswerda, G. (1989). Uniform crossover in genetic algorithms. In Schaffer, J., editor, Proceedings of the 3rd International Conference on Genetic Algorithms, pages 2–9, San Mateo, CA. Morgan Kaufmann.
Westerberg, C. H. and Levine, J. (2001). Investigation of different seeding strategies in a genetic planner. In Boers, E., Cagnoni, S., Gottlieb, J., Hart, E., Lanzi, P., Raidl, G., Smith, R., and Tijink, H., editors, Applications of Evolutionary Computing, volume 2037 of Lecture Notes in Computer Science, pages 505–514. Springer-Verlag, Berlin Heidelberg.
Wolpert, D. H. and Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, l(l):67–82.
Yannakakis, M. (1997). Computational complexity. In Aarts, E. and Lenstra, J., editors, Local Search in Combinatorial Optimization, pages 19–55. Wiley, Chichester.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Cotta, C., Moscato, P. (2004). Evolutionary Computation: Challenges and Duties. In: Menon, A. (eds) Frontiers of Evolutionary Computation. Genetic Algorithms and Evolutionary Computation, vol 11. Springer, Boston, MA. https://doi.org/10.1007/1-4020-7782-3_3
Download citation
DOI: https://doi.org/10.1007/1-4020-7782-3_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7524-7
Online ISBN: 978-1-4020-7782-1
eBook Packages: Springer Book Archive