Abstract
As the field of evolutionary optimization continues to expand, it is becoming increasingly common to incorporate various machine learning approaches, such as clustering, classification, and regression models, to improve algorithmic efficiency. However, we note that although problem learning is popularly used in improving the ongoing optimization process, little effort is ever made in extracting re-usable domain knowledge. In other words, the acquired knowledge is seldom transferred and exploited for future design exercises. Focusing on evolutionary optimization, in this paper we investigate the concept of simultaneous problem learning and optimization inspired by the following notions: (1) that prior/dynamically acquired knowledge can enhance the effectiveness of evolutionary search, and (2) that evolution can be geared towards gathering crucial knowledge about the underlying problem. Taking benchmark functions as well as an engineering (process) design problem into consideration, we demonstrate the efficacy of a novel classifier-assisted constrained EA towards simultaneous evolutionary search and problem learning.













Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Aranha C, Iba H (2009) The memetic tree-based genetic algorithm and its application to portfolio optimization. Memet Comput 1(2):139–151
Becerra RL, Coello CAC (2006) Cultured differential evolution for constrained optimization. Comput Methods Appl Mech Eng 195(33):4303–4322
Bosman PA, Thierens D (1999) An algorithmic framework for density estimation based evolutionary algorithms. Utrecht University Repository, Netherlands
Branke J, Nguyen S, Pickardt CW, Zhang M (2016) Automated design of production scheduling heuristics: a review. IEEE Trans Evol Comput 20(1):110–124
Cagnina LC, Esquivel SC, Coello CAC (2011) Solving constrained optimization problems with a hybrid particle swarm optimization algorithm. Eng Optim 43(8):843–866
Chen Q, Xue B, Zhang M (2015) Generalisation and domain adaptation in GP with gradient descent for symbolic regression. In: 2015 IEEE congress on evolutionary computation (CEC), IEEE, pp 1137–1144
Chen X, Ong YS, Lim MH, Tan KC (2011) A multi-facet survey on memetic computation. IEEE Trans Evol Comput 15(5):591
Elliott L, Ingham DB, Kyne AG, Mera NS, Pourkashanian M, Wilson CW (2004) An informed operator based genetic algorithm for tuning the reaction rate parameters of chemical kinetics mechanisms. In: Genetic and evolutionary computation conference, Springer Berlin Heidelberg, pp 945–956
Feng L, Ong YS, Lim MH, Tsang IW (2015) Memetic search with interdomain learning: a realization between CVRP and CARP. IEEE Trans Evol Comput 19(5):644–658
Feng L, Ong YS, Tan AH, Tsang IW (2015) Memes as building blocks: a case study on evolutionary optimization+ transfer learning for routing problems. Memet Comput 7(3):159–180
Giannakoglou KC, Papadimitriou DI, Kampolis IC (2006) Aerodynamic shape design using evolutionary algorithms and new gradient-assisted metamodels. Comput Methods Appl Mech Eng 195(44):6312–6329
Gupta A, Kelly P (2013) Optimal Galerkin finite element methods for non-isothermal liquid composite moulding process simulations. Int J Heat Mass Transf 64:609–622
Gupta A, Kelly PA, Bickerton S, Walbran WA (2012) Simulating the effect of temperature elevation on clamping force requirements during rigid-tool liquid composite moulding processes. Compos A Appl Sci Manuf 43(12):2221–2229
Gupta A, Kelly PA, Ehrgott M, Bickerton S (2013) A surrogate model based evolutionary game-theoretic approach for optimizing non-isothermal compression RTM processes. Compos Sci Technol 84:92–100
Gupta A, Mańdziuk J, Ong YS (2015) Evolutionary multitasking in bi-level optimization. Complex Intell Syst 1(1–4):83–95
Gupta A, Ong YS, Feng L (2016) Multifactorial evolution: toward evolutionary multitasking. IEEE Trans Evol Comput 20(3):343–357
Gupta A, Ong YS, Feng L, Tan KC (2016) Multiobjective multifactorial optimization in evolutionary multitasking. IEEE Trans Cybern. doi:10.1109/TCYB.2016.2554622
Han J, Pei J, Kamber M (2011) Data mining: concepts and techniques. Elsevier, Amsterdam
Handoko SD, Kwoh CK, Ong YS (2010) Feasibility structure modeling: an effective chaperone for constrained memetic algorithms. IEEE Trans Evol Comput 14(5):740–758
Hasan SK, Sarker R, Essam D, Cornforth D (2009) Memetic algorithms for solving job-shop scheduling problems. Memet Comput 1(1):69–83
Holland JH (1962) Outline for a logical theory of adaptive systems. J ACM 9(3):297–314
Iqbal M, Browne WN, Zhang M (2014) Reusing building blocks of extracted knowledge to solve complex, large-scale boolean problems. IEEE Trans Evol Comput 18(4):465–480
Iqbal M, Browne WN, Zhang M (2015) Extending XCS with cyclic graphs for scalability on complex Boolean problems. Evolut Comput, Early Access article. doi:10.1162/EVCO_a_00167
Jin X, Reynolds RG (1999) Using knowledge-based evolutionary computation to solve nonlinear constraint optimization problems: a cultural algorithm approach. In: Proceedings of the 1999 congress on evolutionary computation, CEC 99, vol 3. IEEE
Jin Y, Sendhoff B (2002) Fitness approximation in evolutionary computation—a survey. In: Proceedings of the genetic and evolutionary computation conference, Morgan Kaufmann Publishers Inc., pp 1105–1112
Jin Y, Sendhoff B (2004) Reducing fitness evaluations using clustering techniques and neural network ensembles. In: Genetic and evolutionary computation conference, Springer Berlin Heidelberg, pp 688–699
Johnson CG, Cardalda JJR (2002) Genetic algorithms in visual art and music. Leonardo 35(2):175–184
Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black-box functions. J Global Optim 13(4):455–492
Jourdan L, Dhaenens C, Talbi EG (2006) Using datamining techniques to help metaheuristics: a short survey. In: International workshop on hybrid metaheuristics, Springer Berlin Heidelberg, pp 57–69
Kamal MR, Sourour S (1973) Kinetics and thermal characterization of thermoset cure. Polym Eng Sci 13(1):59–64
Kim HS, Cho SB (2001) An efficient genetic algorithm with less fitness evaluation by clustering. In: Proceedings of the 2001 congress on evolutionary computation, vol 2. IEEE, pp 887–894
Knowles J (2006) ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Trans Evol Comput 10(1):50–66
Lameijer EW, Bäck T, Kok JN, Ijzerman AP (2005) Evolutionary algorithms in drug design. Nat Comput 4(3):177–243
Larranaga P, Lozano JA (2002) Estimation of distribution algorithms: a new tool for evolutionary computation, vol 2. Springer, Berlin
Le MN, Ong YS, Nguyen QH (2008) Optinformatics for schema analysis of binary genetic algorithms. In: Proceedings of the 10th annual conference on genetic and evolutionary computation, ACM, pp 1121–1122
Leifsson L, Koziel S (2016) Surrogate modelling and optimization using shape-preserving response prediction: a review. Eng Optim 48(3):476–496
Lim D, Jin Y, Ong YS, Sendhoff B (2010) Generalizing surrogate-assisted evolutionary computation. IEEE Trans Evol Comput 14(3):329–355
Lim D, Ong YS, Jin Y, Sendhoff B (2007) A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation. In: Proceedings of the 9th annual conference on genetic and evolutionary computation, ACM, pp 1288–1295
Meuth R, Lim MH, Ong YS, Wunsch DC II (2009) A proposition on memes and meta-memes in computing for higher-order learning. Memet Comput 1(2):85–100
Mezura-Montes E, Coello CAC (2005) A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans Evol Comput 9(1):1–17
Michalski RS (2000) Learnable evolution model: evolutionary processes guided by machine learning. Mach Learn 38(1–2):9–40
Mitchell TM (1999) Machine learning and data mining. Commun ACM 42(11):30–36
Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithmsC3P. Caltech Concurr Comput Progr Rep 826:1989
Muñoz E, Cadenas JM, Ong YS, Acampora G (2016) Memetic music composition. IEEE Trans Evol Comput 20(1):1–15
Okabe T, Jin Y, Sendoff B, Olhofer M (2004) Voronoi-based estimation of distribution algorithm for multi-objective optimization. In: Congress on evolutionary computation, 2004. CEC2004. vol 2. IEEE, pp 1594–1601
Ong YS, Gupta A (2016) Evolutionary multitasking: a computer science view of cognitive multitasking. Cogn Comput 8(2):125–142
Ong YS, Keane AJ (2004) Meta-Lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8(2):99–110
Ong YS, Lim MH, Chen X (2010) Research frontier-memetic computation—past, present & future. IEEE Comput Intell Mag 5(2):24
Ong YS, Nair PB, Keane AJ (2003) Evolutionary optimization of computationally expensive problems via surrogate modeling. AIAA J 41(4):687–696
Pelikan M, Goldberg DE, Cantú-Paz E (1999) BOA: The Bayesian optimization algorithm. In: Proceedings of the 1st annual conference on genetic and evolutionary computation, vol 1. Morgan Kaufmann Publishers Inc., pp 525–532
Quinlan JR (1986) Induction of decision trees. Mach Learn 1(1):81–106
Quinlan JR (2014) C4. 5: programs for machine learning. Elsevier, Amsterdam
Ramsey CL, Grefenstette JJ (1993) Case-based initialization of genetic algorithms. In: ICGA, pp 84–91
Rasheed K, Hirsh H (2000) Informed operators: speeding up genetic-algorithm-based design optimization using reduced models. In: Proceedings of the 2nd annual conference on genetic and evolutionary computation, Morgan Kaufmann Publishers Inc., pp 628–635
Rechenberg I (1965) Cybernetic solution path of an experimental problem (Royal Aircraft Establishment Translation No. 1122, B.F. Toms, Trans). Ministry of Aviation, Royal Aircraft Establishment, Farnsborough Hants
Reynolds RG, Michalewicz Z, Cavaretta MJ (1995) Using cultural algorithms for constraint handling in GENOCOP. In: Evolutionary programming, pp 289–305
Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284–294
Sun G, Li G, Gong Z, He G, Li Q (2011) Radial basis functional model for multi-objective sheet metal forming optimization. Eng Optim 43(12):1351–1366
Tsutsui S, Pelikan M, Goldberg DE (2001) Probabilistic model-building genetic algorithms using marginal histograms in continuous domain. In: Proceedings of the international conference on knowledge-based and intelligent information and engineering systems, pp 112–121
Walbran WA (2011) Experimental validation of local and global force simulations for rigid tool liquid composite moulding processes. Doctoral dissertation, ResearchSpace@ Auckland
Wang Y, Cai Z, Guo G, Zhou Y (2007) Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems. IEEE Trans Syst Man Cybern Part B 37(3):560–575
Wang Y, Cai Z, Zhou Y, Zeng W (2008) An adaptive tradeoff model for constrained evolutionary optimization. IEEE Trans Evol Comput 12(1):80–92
Zhang Q, Liu W, Tsang E, Virginas B (2010) Expensive multiobjective optimization by MOEA/D with Gaussian process model. IEEE Trans Evol Comput 14(3):456–474
Zhang Q, Zhou A, Jin Y (2008) RM-MEDA: A regularity model-based multiobjective estimation of distribution algorithm. IEEE Trans Evol Comput 12(1):41–63
Zhou Z, Ong YS, Nair PB, Keane AJ, Lum KY (2007) Combining global and local surrogate models to accelerate evolutionary optimization. IEEE Trans Syst Man Cybern Part C 37(1):66–76
Zhou Z, Ong YS, Nguyen MH, Lim D (2005) A study on polynomial regression and Gaussian process global surrogate model in hierarchical surrogate-assisted evolutionary algorithm. In 2005 IEEE congress on evolutionary computation, vol 3. IEEE, pp 2832–2839
Acknowledgments
This work was conducted within the Rolls-Royce@NTU Corporate Lab with support from the National Research Foundation (NRF) Singapore under the Corp Lab@University Scheme.
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
The filling phase of a generic composites manufacturing process is governed by the following PDEs [13]:
Equation 6 governs the fluid flow in porous media. Here, h is the thickness of the mould cavity, p is the local resin pressure, K is the reinforcement permeability, t is the time, and ∂h/∂t represents the speed of mould closure. Note that ∂h/∂t is zero throughout the RTM cycle, but is zero or strictly negative for the I/C-LCM cycle (due to decreasing cavity thickness during the in situ mould compression phase). The viscosity μ of the resin is a function of the local temperature T and the degree of resin conversion α. The relation may be captured by the following widely used rheological model,
where α g is the degree of cure at which resin gel conversion occurs, R is the universal gas constant, E µ is the activation energy, and A µ , a and b are other experimentally determined constants.
Equation 7 is a lumped energy equation which governs the temperature distribution within the mould. The material properties ρ, C p , and k represent the average density, specific heat capacity, and thermal conductivity of the resin-fibre system, respectively. Further, u is the volume averaged resin flow velocity, V f is the fibre volume fraction, and \(\dot{H}\) is a source term representing the thermal energy generated by the resin during its exothermic polymerization reaction.
Finally, Eq. 8 models how the degree of resin conversion varies in the part during filling. Therein, R α represents the rate of resin polymerization. Kamal and Sourour [30] proposed the following general model which is widely used to describe the polymerization reaction,
where A 1, A 2, E 1, E 2, m 1, and m 2 are experimentally determined constants.
For complete details on the material properties and empirical constants used in the composites manufacturing case study, the reader is referred to [13].
Rights and permissions
About this article
Cite this article
Lim, D., Ong, Y.S., Gupta, A. et al. Towards a new Praxis in optinformatics targeting knowledge re-use in evolutionary computation: simultaneous problem learning and optimization. Evol. Intel. 9, 203–220 (2016). https://doi.org/10.1007/s12065-016-0146-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12065-016-0146-1