Evolutionary algorithms to solve loosely constrained permut-CSPs: A practitioners approach

International Journal of Innovative Computing, Information and Control

Volumn 8, Issue 7 A, 2012, Pages 4771-4796

  de Marcos, Luis ^a   García Cabot, Antonio ^a   García, Eva ^a  

^a UNIVERSITY OF ALCALÁ   (Spain)

Author keywords

Constraint satisfaction; CSP; Genetic algorithm; PSO

Indexed keywords

CONSTRAINT SATISFACTION; CONSTRAINT SATISFACTION PROBLEMS; CSP; DESIGN AND TESTS; DEVELOPMENT COSTS; EVOLUTIONARY APPROACH; LOW DENSITY; PSO; REAL-WORLD APPLICATION; TEST CASE;

COMPUTATIONAL METHODS; COMPUTER APPLICATIONS;

GENETIC ALGORITHMS;

EID: 84862330085     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (55)

1. E. Tsang, Foundations of Constraint Satisfaction, Academic Press, London, 1993.
2. A. Banks, J. Vincent and C. Anyakoha, A review of particle swarm optimization. Part II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications, Nat. Comput., vol.7, no.1, pp.1567-7818, 2008.
3. L. Davis, Handbook of Genetic Algorithms, Thomson Publishing, Washington, USA, 1991.
4. R. Poli, J. Kennedy, T. Blackwell and A. Freitas, Analysis of the publications on the applications of particle swarm optimisation, J. Artif. Evol. Applic., vol.2008, no.1, pp.1-10, 2008.
5. L. Yao, Y.-C. Chou and C.-C. Lin, Scheduling of direct load control using genetic programming, International Journal of Innovative Computing, Information and Control, vol.7, no.5(A), pp.2515-2528, 2011.
6. A. Yardimci, Soft computing in medicine, Appl. Soft Comput., vol.9, no.3, pp.1029-1043, 2009.
7. A. Bouchachia, R. Mittermeir, P. Sielecky, S. Stafiej and M. Zieminski, Nature-inspired techniques for conformance testing of object-oriented software, Appl. Soft Comput., vol.10, no.3, pp.730-745, 2010.
8. T. Mantere and J. T. Alander, Evolutionary software engineering, a review, Appl. Soft Comput., vol.5, no.3, pp.315-331, 2005.
9. D.-F. Shiau, A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences, Expert Syst. Appl., vol.38, no.1, pp.235-248, 2011.
10. L. de-Marcos, J. J. Martinez, J. A. Gutiérrez, R. Barchino and J. M. Gutiérrez, A new sequencing method in web-based education, Proc. of the IEEE Congress on Evolutionary Computation, Trondheim, Norway, pp.3219-3225, 2009.
11. V. Oduguwa, A. Tiwari and R. Roy, Evolutionary computing in manufacturing industry: An overview of recent applications, Appl. Soft Comput., vol.5, no.3, pp.281-299, 2005.
12. Y.-L. Huang, S.-J. Horng, T.-W. Kao, R.-S. Run, J.-L. Lai, R.-J. Chen, I.-H. Kuo and M. K. Khan, An improved forecasting model based on the weighted fuzzy relationship matrix combined with a PSO adaptation for enrollments, International Journal of Innovative Computing, Information and Control, vol.7, no.7(A), pp.4027-4046, 2011.
13. A. B. Siddiqui, M. A. Jafiar, A. Hussain and A. M. Mirza, Block-based pixel level multi-focus image fusion using particle swarm optimization, International Journal of Innovative Computing, Information and Control, vol.7, no.7(A), pp.3583-3596, 2011.
14. T. Niknam, H. D. Mojarrad and M. Nayeripour, A new hybrid fuzzy adaptive particle swarm optimization for non-convex economic dispatch, International Journal of Innovative Computing, Information and Control, vol.7, no.2, pp.189-202, 2011.
15. J. Robinson and Y. Rahmat-Samii, Particle swarm optimization in electromagnetics, IEEE Trans, on Antennas and Propagation, vol.52, no.2, pp.397-407, 2004.
16. J. H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Michigan, USA, 1975.
17. R. Eberhart and J. Kennedy, A new optimizer using particle swarm theory, Proc. of the 6th International Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995.
18. J. Kennedy and R. Eberhart, Particle swarm optimization, Proc. of the IEEE International Conference on Neural Networks, Perth, WA, Australia, 1995.
19. T. Hogg, Refining the phase transition in combinatorial search, Artif. Intell., vol.81, no.1-2, pp.127-154, 1996.
20. P. Prosser, An empirical study of phase transitions in binary constraint satisfaction problems, Artif. Intell, vol.81, pp.81-109, 1996.
21. A. E. Eiben, R. Hinterding and Z. Michalewicz, Parameter control in evolutionary algorithms, IEEE Trans. Evol. Comput., vol.3, no.2, pp.124-141, 1999.
22. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Readomg, USA, 1989.
23. J. Kennedy and R. C. Eberhart, A discrete binary version of the particle swarm algorithm, Proc. of IEEE International Conference on Systems, Man, and Cybernetics, Orlando, FL, 1997.
24. X. Hu, R. C. Eberhart and Y. Shi, Swarm intelligence for permutation optimization: A case study of n-queens problem, Proc, of the IEEE Swarm Intelligence Symposium, Indianapolis, USA, 2003.
25. L. Schoofs and B. Naudts, Ant colonies are good at solving constraint satisfaction problems, Proc. of the Congress on Evolutionary Computation, La Jolla, CA, 2000.
26. C. Solnon, Ants can solve constraint satisfaction problems, IEEE Trans. Evol. Comput., vol.6, no.4, pp.347-356, 2002.
27. S. K. Smit and A. E. Eiben, Comparing parameter tuning methods for evolutionary algorithms, IEEE Congress on Evolutionary Computation, 2009.
28. R. Tan, S. Wang, Y. Jiang, K. Ishida and M. G. Fujie, Motion control with parameter optimization by genetic algorithm, ICIC Express Letters, vol.5, no.8(B), pp.2779-2784, 2011.
29. V. Nannen, S. Smit and A. Eiben, Costs and benefits of tuning parameters of evolutionary algorithms, in Parallel Problem Solving from Nature-PPSN X, G. Rudolph et al. (eds.), Springer, 2008.
30. M. Rashid and A. R. Baig, PSOGP: A genetic programming based adaptable evolutionary hybrid particle swarm optimization, International Journal of Innovative Computing, Information and Control, vol.6, no.1, pp.287-296, 2010.
31. B. Jarboui, N. Damak, P. Siarry and A. Rebai, A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems, Appl. Math. Comput., vol.195, no.1, pp.299-308, 2008.
32. D. Merkle, M. Middendorf and H. Schmeck, Ant colony optimization for resource-constrained project scheduling, IEEE Trans. Evol. Comput., vol.6, no.4, pp.333-346, 2002.
33. 2PSO: Personalized e-course composition based on particle swarm optimization, Appl. Intell., vol.34, no.1, pp.141-154, 2009.
34. L. de-Marcos, R. Barchino, J. J. Martinez and J. A. Gutierrez, A new method for domain independent curriculum sequencing: A case study in a web engineering master program, Int. J. Eng. Educ., vol.25, no.4, pp.632-645, 2009.
35. T. Hogg, B. A. Huberman and C. P. Williams, Phase transitions and the search problem, Artif. Intell., vol.81, pp.1-15, 1996.
36. M. Mitchell, An Introduction to Genetic Algorithms (Complex Adaptive Systems), The MIT Press, Cambridge, MA, 1998.
37. R. Mendes, J. Kennedy and J. Neves, The fully informed particle swarm: Simpler, maybe better, IEEE Trans. Evol. Comput., vol.8, no.3, pp.204-210, 2004.
38. A. Banks, J. Vincent and C. Anyakoha, A review of particle swarm optimization. Part I: background and development, Nat. Comput., vol.6, no.4, pp.448-467, 2007.
39. Y. Shi and R. Eberhart, Parameter selection in particle swarm optimization, Proc. of the 7th International Conference on Evolutionary Programming, San Diego, USA, 1998.
40. T. Bäck, L. J. Fogel and Z. Michalewicz, Evolutionary Computation 1: Basic Algorithms and Operators, Institute of Physics Publishing, Bristol, UK, 2000.
41. A. E. Eiben and J. E. Smith, Introduction to Evolutionary Computing (Natural Computing Series), Springer, Berlin, Germany, 2003.
42. G. Syswerda, Schedule optimisation using genetic algorithms, in Handbook of Genetic Algorithms, L. Davis (ed.), Thomson Publishing, Washington, USA, 1991.
43. D. E. Goldberg and R. Lingle, Alleles, loci and the traveling salesman problem, Proc. of the 1st International Conference on Genetic Algorithms and their Application, Lawrence Erlbaum, Cambridge, USA, 1985.
44. L. D. Whitley, Permutations, Evolutionary Computation 1: Basic Algorithms and Operators, T. Bäck, L.J. Fogel and Z. Michalewicz (eds.), Institute of Physics Publishing, Bristol, UK, 2000.
45. I. M. Olivier, D. J. Smith and J. H. Holland, A study of permutation crossover operators on the traveling salesman problem, Proc. of the 1st International Conference on Genetic Algorithms and Their Application, Cambridge, USA, 1985.
46. K. de Jong and J. Sarma, On decentralizing selection algorithms, Proc. of the 6th international Conference on Genetic Algorithms, San Francisco, CA, USA, pp.17-23, 1995.
47. J. E. Baker, Reducing bias and inefficiency in the selection algorithm. Proc. of the 2nd International Conference on Genetic Algorithms on Genetic Algorithms and Their Application, pp.14-21, 1987.
48. T. Bäck, Generalised convergence models for tournament and (μ, Λ) selection, Proc. of the 6th International Conference on Genetic Algorithms, pp.2-8, 1995.
49. L. D. Whitley and J. Kauth, Genitor: A different genetic algorithm. Proc. of the Rocky Mountain Conference on Artificial Intelligence, pp.118-130, 1988.
50. A. Eiben, M. Schut and A. de Wilde, Is self-adaptation of selection pressure and population size possible?-A case study, Parallel Problem Solving from Nature-PPSN IX, LNCS, pp.900-909, 2006.
51. L. de-Marcos, J. J. Martinez, J. A. Gutierrez, R. Barchino, J. R. Hilera, S. Otôn and J. M. Gutierrez, Genetic algorithms for courseware engineering, International Journal of Innovative Computing, Information and Control, vol.7, no.7, pp.3981-4004, 2011.
52. D. Karaboga and B. Basturk, On the performance of artificial bee colony (ABC) algorithm, Appl. Soft Comput., vol.8, no.1, pp.687-697, 2008.
53. L. de-Marcos, A. Garcia, E. Garcia, J. J. Martinez, J. A. Gutiérrez, R. Barchino, J. M. Gutiérrez, J. R. Hilera and S. Otôn, An adaptation of the parliamentary metaheuristic for permutation constraint satisfaction, Proc. of the IEEE Congress on Evolutionary Computation, Barcelona, Spain, pp.834-841, 2010.
54. T. Ray and K. M. Liew, Society and civilization: An optimization algorithm based on the simulation of social behavior, IEEE Trans. Evol. Comput., vol.7, no.4, pp.386-396, 2003.
55. C. Soza, R. L. Becerra, M. C. Riff and C. A. C. Coello, Solving timetabling problems using a cultural algorithm, Appl. Soft Comput., vol.11, no.1, pp.337-344, 2011.