A hybrid evolutionary approach for solving constrained optimization problems over finite domains

IEEE Transactions on Evolutionary Computation

Volumn 4, Issue 4, 2000, Pages 353-372

  Ruiz Andino, Alvaro ^a   Araujo, Lourdes ^a   Sáenz, Fernando ^a,b   Ruz, José ^a,c  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b University Complutense of Madrid ^*  (Spain)

^c IEEE   (Spain)

Author keywords

Arc consistency; Constrained combinatorial optimization problems; Evolution programs

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; GENETIC ALGORITHMS; MATHEMATICAL OPERATORS;

CONSTRAINED OPTIMIZATION PROBLEMS; GENETIC OPERATORS;

MATHEMATICAL PROGRAMMING;

EID: 0034316501     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.887235     Document Type: Article

References (19)

1. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed. Berlin, Germany: Springer, 1996.
2. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
3. T. Bäck, U. H. Hammel, and H.-P. Schvefel, "Evolutionary computation: Comments on the history and current state," IEEE Trans. Evol. Comput., vol. 1, pp. 3-17, Apr. 1997.
4. A. E. Eiben, P. E. Raué, and Z. Ruttkay, Constrained Problems. Boca Raton, FL: CRC Press, 1995, pp. 307-365.
5. E. Marchiori, "Combining constraint processing and genetic algorithms for constraint satisfaction problems," in Proc. 7th Int. Conf. Genetic Algorithms. CA, 1997, pp. 330-337.
6. M. C. Riff-Rojas, "Using knowledge of the constraint network to design an evolutionary algorithm that solves CSP," in Proc. 4th IEEE Conf. Evol. Comput.. New York, NY, 1997, pp. 279-284.
7. J. Bowen and G. Dozier, "Solving constraint satisfaction problems using a genetic/systematic search hybrid that realizes when to quit," in Proc. 6th Int. Conf. Genetic Algorithms. CA, 1995, pp. 122-129.
8. A. E. Eiben and Z. Ruttkay, "Self-adaptivity for constraint satisfaction: Learning penalty functions," in Proc. 3rd IEEE Conf. Evol. Comput.. New York: IEEE Press, 1996, pp. 258-261.
9. J. Paredis, "Co-evolutionary computation," Artif. Life, vol. 2, no. 4, pp. 355-375, 1996.
10. G. Dozier, J. Bowen, and A. Homaifar, "Solving constraint satisfaction problems using hybrid evolutionary search," IEEE Trans. Evol. Comput., vol. 2, pp. 23-33, Apr. 1998.
11. J. Joines and C. Houck, "On the use of non-stationary penalty functions to solve non-linear constrained optimisation problems with gas," in Proc. 1st IEEE Conf. Evol. Comput.. New York: IEEE, 1994, pp. 579-584.
12. A. Homaifar, S. H. Lai, and X. Qi, "Constrained optimisation by genetic algorithms," Simulation, vol. 62, no. 4, pp. 242-254, 1994.
13. D. Minton, M. D. Johnston, A. B. Philips, and P. Laird, "Minimising conflicts: A heuristic repair method for constraint satisfaction and scheduling problems," Artif. Intell., vol. 58, no. 1-3, pp. 161-205, 1992.
14. Z. Michalewicz and G. Nazhiyath, "Genocop III. A co-evolutionary algorithm for numerical optimisation problems with non-linear constraints," in Proc. 2nd IEEE Conf. Evol. Comput.. New York: IEEE, 1995, pp. 647-651.
15. J. Beasley and P. Chu, "A genetic algorithm for the set covering problem," Euro. J. Oper. Res., vol. 94, no. 2, pp. 393-404, 1996.
16. V. Schnecke and O. Vornberger, "Hybrid genetic algorithms for constraines placement problems," IEEE Trans. Evol. Comput., vol. 1, no. 4, pp. 266-277, 1997.
17. K. Marriot and J. S. Stuckey, Programming with Constraints: An Introduction. Cambridge, MA: M.I.T. Press, 1998.
18. E. Tsang, Foundations of Constraint Satisfaction. New York: Academic, 1993.
19. M. Wallace, "Constraints in planing, scheduling and placement problems," in P roc. 2nd Int. Workshop Principles and Practice of Constraint Programming, vol. 874, Lecture Notes in Comput. Sci.. Berlin, 1994.