Issues on the Optimisation of Evolutionary Algorithms Code

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{Collet:2002:IotOoEAC,

• author = "Pierre Collet and Jean Louchet and Evelyne Lutton",
• title = "Issues on the Optimisation of Evolutionary Algorithms Code",
• booktitle = "Proceedings of the 2002 Congress on Evolutionary Computation CEC2002",
• editor = "David B. Fogel and Mohamed A. El-Sharkawi and Xin Yao and Garry Greenwood and Hitoshi Iba and Paul Marrow and Mark Shackleton",
• pages = "1103--1108",
• year = "2002",
• publisher = "IEEE Press",
• publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway, NJ 08855-1331, USA",
• organisation = "IEEE Neural Network Council (NNC), Institution of Electrical Engineers (IEE), Evolutionary Programming Society (EPS)",
• keywords = "genetic algorithms, genetic programming, code optimisation, computation time, computational complexity, evolutionary algorithms, fitness, testbenches, computational complexity, evolutionary computation,",
• ISBN = "0-7803-7278-6",
• month = "12-17 " # may,
• DOI = "doi:10.1109/CEC.2002.1004397",
• abstract = "The aim of this paper is to show that the common belief, in the evolutionary community, that evaluation time usually takes over 90percent of the total time, is far from being always true. In fact, many real-world applications showed a much lower percentage. This raises several questions, one of them being the balance between fitness and operators computational complexity: what is the use of elaborating smart evolutionary operators to reduce the number of evaluations if as a result, the total computation time is increased?",
• notes = "CEC 2002 - A joint meeting of the IEEE, the Evolutionary Programming Society, and the IEE. Held in connection with the World Congress on Computational Intelligence (WCCI 2002)",

}

Genetic Programming entries for Pierre Collet Jean Louchet Evelyne Lutton

Citations