Abstract
We propose a metamodel approach to the approximation of functions gradients within a hybrid genetic algorithm. The underlying structure is implemented in order to support parallel execution of the code: a genetic and a SQP algorithm run in different threads and can ask designs evaluations independently, but keeping all the available resources always working. A common archive collects the results and generates the population for the GA and the starting points for the SQP runs. A particular attention is dedicated to elitism and to constraints. The hybridization is performed through a modified ε −constrained method. The general philosophy of the algorithm is to concentrate on not wasting information: metamodels, archiving and elitism, steady-state parallel evolution are key elements for this scope and they will be discussed in details. A preliminary but explanatory row of tests concludes the paper highlighting the benefits of this new approach.
This is a preview of subscription content, log in via an institution to check access.
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
Aittokoski, T., Miettinen, K.: Efficient evolutionary method to approximate the Pareto optimal set in multiobjective optimization. In: EngOpt 2008 (2008)
Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: A Brief Survey on Hybrid Metaheuristics. In: Filipic, B., Silc, J. (eds.) Proceedings of BIOMA 2010 (2010) ISBN: 978-961-264-017-0
Buhmann, M.D.: Radial Basis Functions: Theory and Implementations. Cambridge University Press, Cambridge (2003)
Das, S., Suganthan, P.N.: Problem Definitions and Evaluation Criteria for CEC 2011 Competition on Testing Evolutionary Algorithms in Real World Optimization Problems. Technical Report (2010), http://www3.ntu.edu.sg/home/EPNSugan/
Deb, K.: Multi-objective optimization using evolutionary algorithms. Wiley, UK (2001)
Deb, K., Agraval, S.: Simulated binary crossover for continuous search space. Complex System 9, 115–148 (1995)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. KanGal Report, 200001 (2000)
Deb, K., Goel, T.: Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence. KanGal Report, 200004 (2001)
Deb, K., Mathur, A.P., Meyarivan, T.: Constrained Test Problems for Multi-objective Evolutionary Optimization. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 284–298. Springer, Heidelberg (2001)
Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Mathematical Programming 91, 239–269 (2002)
Gould, N.I.M., Toint, P.L.: SQP Methods for Large-Scale Nonlinear Programming. Invited Presentation at the 9th IFIP TC7 Conference on System Modelling and Optimization, Cambridge (1999)
Kumar, A., Sharma, D., Deb, K.: A hybrid multi-objective optimization procedure using PCX based NSGA-II and sequential quadratic programming. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 3011–3018 (2008)
Miettinen, K.M.: Nonlinear Multiobjective Optimization. Kluvert Academic Publisher, Boston (1999)
Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)
Osyczka, A., Kundu, S.: A new method to solve generalized multicriteria oprimization problems using the simple genetic algorithm. Structural Optimization 10, 94–99 (1995)
Rigoni, E., Turco, A.: Metamodels for Fast Multi-objective Optimization: Trading Off Global Exploration and Local Exploitation. In: Deb, K., Bhattacharya, A., Chakraborti, N., Chakroborty, P., Das, S., Dutta, J., Gupta, S.K., Jain, A., Aggarwal, V., Branke, J., Louis, S.J., Tan, K.C. (eds.) SEAL 2010. LNCS, vol. 6457, pp. 523–532. Springer, Heidelberg (2010)
Rudolph, G., Naujoks, B., Preuß, M.: Capabilities of EMOA to Detect and Preserve Equivalent Pareto Subsets. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 36–50. Springer, Heidelberg (2007)
Sharma, D., Kumar, A., Deb, K., Sindhya, K.: Hybridization of SBX based NSGA-II and sequential quadratic programming for solving multi-objective optimization problems. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 3003–3010 (2008)
Strikwerda, J.: Finite Difference Schemes and Partial Differential Equations. SIAM, Philadelphia (2004)
Turco, A.: Adaptive Filter SQP. In: Blum, C., Battiti, R. (eds.) LION 4. LNCS, vol. 6073, pp. 68–81. Springer, Heidelberg (2010)
Turco, A., Kavka, C.: MFGA: A GA for Complex Real-World Optimization Problems. International Journal of Innovative Computing and Applications 3(1), 31–41 (2011)
Zhang, Q., Zhou, A., Zhao, S., Suganthan, P.N., Liu, W., Tiwari, S.: Multiobjective optimization Test Instances for the CEC 2009 Special Session and Competition. Techical Report CES–487 (2009)
Zitzler, E., Deb, K., Thieler, L.: Comparison of multiobjective evolutionary algorithms: Empirical results. IEEE Transactions on Ev. Comp. 8 (2000)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Transactions on Evolutionary Computation 7(2), 117–132 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Turco, A. (2011). MetaHybrid: Combining Metamodels and Gradient-Based Techniques in a Hybrid Multi-Objective Genetic Algorithm. In: Coello, C.A.C. (eds) Learning and Intelligent Optimization. LION 2011. Lecture Notes in Computer Science, vol 6683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25566-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-25566-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25565-6
Online ISBN: 978-3-642-25566-3
eBook Packages: Computer ScienceComputer Science (R0)