Comparing the performance of evolutionary algorithms for permutation constraint satisfaction

Genetic and Evolutionary Computation Conference, GECCO'11 - Companion Publication

Volumn , Issue , 2011, Pages 57-58

  De Marcos, Luis ^a   García, Antonio ^a   García, Eva ^a   Medina, José Amelio ^a   Otón, Salvador ^a  

^a UNIVERSITY OF ALCALÁ   (Spain)

Author keywords

constraint satisfaction; csp; genetic algorithm; pso

Indexed keywords

CONSTRAINT SATISFACTION; CSP; DEVELOPMENT COSTS; HILL CLIMBING; PSO; TEST CASE;

PARTICLE SWARM OPTIMIZATION (PSO);

GENETIC ALGORITHMS;

EID: 80051924961     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001858.2001892     Document Type: Conference Paper

References (9)

1. Tsang, E. Foundations of Constraint Satisfaction. Academic Press, London, 1993.
2. Solnon, C. Ants Can Solve Constraint Satisfaction Problems. IEEE Transactions on Evolutionary Computation, 6, 4 2002), 347-356.
3. Hogg, T., Huberman, B. A. and Williams, C. P. Phase transitions and the search problem. Artificial Intelligence, 811996), 1-15.
4. Prosser, P. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 811996), 81-109.
5. Holland, J. H. Adaptation In Natural and Artificial Systems. The University of Michigan Press, Michigan (USA), 1975.
6. Eberhart, R. and Kennedy, J. A new optimizer using particle swarm theory. City, 1995.
7. Kennedy, J. and Eberhart, R. Particle swarm optimization. City, 1995.
8. Hu, X., Eberhart, R. C. and Shi, Y. Swarm intelligence for permutation optimization: a case study of n-queens problem. IEEE Press, City, 2003.
9. Mendes, R., Kennedy, J. and Neves, J. The fully informed particle swarm: simpler, maybe better. Evolutionary Computation, IEEE Transactions on, 8, 3 2004), 204-210.