Abstract
This paper introduces Incentive Method to handle both hard and soft constraints in an evolutionary algorithm for solving some multi-constraint optimization problems. The Incentive Method uses hard and soft constraints to help allocating heuristic search effort more effectively. The main idea is to modify the objective fitness function by awarding differential incentives according to the defined qualitative preferences, to solution sets which are divided by their satisfaction to constraints. It does not exclude the right to access search spaces that violate some or even all constraints. We test this technique through its application on generating solutions for a classic infinite-horizon extensive-form game. It is solved by an Evolutionary Algorithm incorporated by Incentive method. Experimental results are compared with results from a penalty method and from a non-constraint setting. Statistic analysis suggests that Incentive Method is more effective than the other two techniques for this specific problem.
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
Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. The MIT Press, USA (1992)
Miller, J.: The Co-evolution of Automata in the Repeated Prisoner’s Dilemma. Journal of Economic Behavior and Organization 29(1), 87–112 (1996)
Jin, N., Tsang, E.: Co-evolutionary Strategies for an Alternating-Offer Bargaining Problem. In: IEEE Symposium on Computational Intelligence and Games (IEEE CIG), Colchester, UK, April 4-6 (2005)
Muthoo, A.: Bargaining Theory with Applications. Cambridge University Press, Cambridge (1999)
Rubinstein, A.: Perfect Equilibrium in a Bargaining Model. Econometrica 50, 97–110 (1982)
Tsang, E., Li, J.: EDDIE for financial forecasting. In: Chen, S.-H. (ed.) Genetic Algorithms and Programming in Computational Finance. Kluwer Series in Computational Finance, Ch. 7, pp. 161–174 (2002)
Tsang, E.P.K.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsang, E., Jin, N. (2006). Incentive Method to Handle Constraints in Evolutionary Algorithms with a Case Study. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds) Genetic Programming. EuroGP 2006. Lecture Notes in Computer Science, vol 3905. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11729976_12
Download citation
DOI: https://doi.org/10.1007/11729976_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33143-8
Online ISBN: 978-3-540-33144-5
eBook Packages: Computer ScienceComputer Science (R0)