Incentive Method to Handle Constraints in Evolutionary Algorithms with a Case Study
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.
KeywordsEvolutionary Algorithm Genetic Program Penalty Method Soft Constraint Hard Constraint
Unable to display preview. Download preview PDF.
- 3.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)Google Scholar
- 6.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)Google Scholar
- 7.Tsang, E.P.K.: Foundations of Constraint Satisfaction. Academic Press, London (1993)Google Scholar