Abstract
Engineering design often requires solutions to constrained optimization problems with highly nonlinear objective and constraint functions. The optimal solutions of most design problems lie on the constraint boundary. In this paper, Infeasibility Driven Evolutionary Algorithm (IDEA) is presented that searches for optimum solutions near the constraint boundary. IDEA explicitly maintains and evolves a small proportion of infeasible solutions. This behavior is fundamentally different from the current state of the art evolutionary algorithms, which rank the feasible solutions higher than the infeasible solutions and in the process approach the constraint boundary from the feasible side of the design space. In IDEA, the original constrained minimization problem with k objectives is reformulated as an unconstrained minimization problem with k + 1 objectives, where the additional objective is calculated based on the relative amount of constraint violation among the population members. The presence of infeasible solutions in IDEA leads to an improved rate of convergence as the solutions approach the constraint boundary from both feasible and infeasible regions of the search space. As an added benefit, IDEA provides a set of marginally infeasible solutions for trade-off studies. The performance of IDEA is compared with Non-dominated Sorting Genetic Algorithm II (NSGA-II) [1] on a set of single and multi-objective mathematical and engineering optimization problems to highlight the benefits.
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
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. Evolutionary Computation. IEEE Transactions 6, 182–197 (2002)
Coello Coello, C.A.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Computer Methods in Applied Mechanics and Engineering 191(11-12), 1245–1287 (2002)
Joines, J., Houck, C.: On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with ga’s. Evolutionary Computation. IEEE World Congress on Computational Intelligence. In: Proceedings of the First IEEE Conference, June 1994, vol. 2, pp. 579–584 (1994)
Kazarlis, S., Petridis, V.: Varying fitness functions in genetic algorithms: Studying the rate of increase of the dynamic penalty terms. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 211–220. Springer, Heidelberg (1998)
Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Transactions on Evolutionary Compution 4, 284–294 (2000)
Xiao, J., Michalewicz, Z., Trojanowski, K.: Adaptive Evolutionary Planner/Navigator for Mobile Robots. IEEE Transactions on Evolutionary Computation 1(1), 18–28 (1997)
Michalewicz, Z., Xiao, J.: Evaluation of Paths in Evolutionary Planner/Navigator. In: Proceedings of the 1995 International Workshop on Biologically Inspired Evolutionary Systems, Tokyo, Japan, May 1995, pp. 45–52 (1995)
Powell, D., Skolnick, M.M.: Using genetic algorithms in engineering design optimization with non-linear constraints. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA 1993), San Mateo, California, pp. 424–431. Morgan Kaufmann Publishers, San Francisco (1993)
Deb, K.: An Efficient Constraint Handling Method for Genetic Algorithms. Computer Methods in Applied Mechanics and Engineering 186(2), 311–338 (2000)
Vieira, D.A.G., Adriano, R.L.S., Krahenbuhl, L., Vasconcelos, J.A.: Handing constraints as objectives in a multiobjective genetic based algorithm. Journal of Microwaves and Optoelectronics 2(6), 50–58 (2002)
Saxena, D.K., Deb, K.: Trading on infeasibility by exploiting constraints criticality through multi-objectivization: A system design perspective. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC 2007), September 25-28, 2007, pp. 919–926 (2007)
Ray, T., Tai, K., Seow, K.: Multiobjective design optimization by an evolutionary algorithm. Engineering Optimization 33(4), 399–424 (2001)
Mezura-Montes, E., Coello Coello, C.A.: Constrained Optimization via Multiobjective Evolutionary Algorithms. In: Knowles, J., Corne, D., Deb, K. (eds.) Multiobjective Problems Solving from Nature: From Concepts to Applications. Natural Computing Series. Springer, Heidelberg (2008)
Kimbrough, S.O., Lu, M., Wood, D.H., Wu, D.-J.: Exploring a Two-Population Genetic Algorithm. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 1148–1159. Springer, Heidelberg (2003)
Hingston, P., Barone, L., Huband, S., While, L.: Multi-level Ranking for Constrained Multi-objective Evolutionary Optimisation. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 563–572. Springer, Heidelberg (2006)
Isaacs, A., Ray, T., Smith, W.: Blessings of maintaining infeasible solutions for constrained multi-objective optimization problems. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC 2008), Hong Kong, pp. 2785–2792 (2008)
Koziel, S., Michalewicz, Z.: Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization. Evolutionary Computation 7(1), 19–44 (1999)
Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. John Wiley and Sons Pvt. Ltd., Chichester (2001)
Bandyopadhyay, S., Saha, S., Maulik, U., Deb, K.: A simulated annealing-based multiobjective optimization algorithm: AMOSA. IEEE Transactions on Evolutionary Computation (2007)
Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms - a comparative case study. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 292–301. Springer, Heidelberg (1998)
Sen, P., Yang, J.: Multiple criteria decision support in engineering design. Springer, London (1998)
Parsons, M., Scott, R.: Formulation of multicriterion design optimization problems for solution with scalar numerical optimization methods. Journal of Ship Research 48(1), 61–76 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Singh, H.K., Isaacs, A., Ray, T., Smith, W. (2008). Infeasibility Driven Evolutionary Algorithm (IDEA) for Engineering Design Optimization. In: Wobcke, W., Zhang, M. (eds) AI 2008: Advances in Artificial Intelligence. AI 2008. Lecture Notes in Computer Science(), vol 5360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89378-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-89378-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89377-6
Online ISBN: 978-3-540-89378-3
eBook Packages: Computer ScienceComputer Science (R0)