An evolutionary search paradigm that learns with past experiences

A major drawback of evolutionary optimization approaches in the literature is the apparent lack of automated knowledge transfers and reuse across problems. Particularly, evolutionary optimization methods generally start a search from scratch or ground zero state, independent of how similar the given new problem of interest is to those optimized previously. In this paper, we present a study on the transfer of knowledge in the form of useful structured knowledge or latent patterns that are captured from previous experiences of problem-solving to enhance future evolutionary search. The essential contributions of our present study include the meme learning and meme selection processes. In contrast to existing methods, which directly store and reuse specific problem solutions or problem sub-components, the proposed approach models the structured knowledge of the strategy behind solving problems belonging to similar domain, i.e., via learning the mapping from problem to its corresponding solution, which is encoded in the form of identified knowledge representation. In this manner, knowledge transfer can be conducted across problems, from differing problem size, structure to representation, etc. A demonstrating case study on the capacitated arc routing problem (CARP) is presented. Experiments on benchmark instances of CARP verified the effectiveness of the proposed new paradigm.

[1]  Liang Feng,et al.  A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem , 2012, Int. J. Syst. Sci..

[2]  G. Ulusoy The fleet size and mix problem for capacitated arc routing , 1985 .

[3]  Kay Chen Tan,et al.  A Multi-Facet Survey on Memetic Computation , 2011, IEEE Transactions on Evolutionary Computation.

[4]  Ah-Hwee Tan,et al.  Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem , 2010, IEEE Congress on Evolutionary Computation.

[5]  Xin Yao,et al.  Improved memetic algorithm for Capacitated Arc Routing Problem , 2009, 2009 IEEE Congress on Evolutionary Computation.

[6]  Richard W. Eglese,et al.  A tabu search based heuristic for arc routing with a capacity constraint and time deadline , 1996 .

[7]  Sushil J. Louis,et al.  Learning with case-injected genetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[8]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[9]  Bernhard Schölkopf,et al.  Measuring Statistical Dependence with Hilbert-Schmidt Norms , 2005, ALT.

[10]  R. Lewontin ‘The Selfish Gene’ , 1977, Nature.

[11]  Barry Smyth,et al.  Case-Based Reasoning in Scheduling: Reusing Solution Components. , 1996 .

[12]  Richard W. Eglese,et al.  Routeing Winter Gritting Vehicles , 1994, Discret. Appl. Math..

[13]  Y. Takefuji,et al.  Vehicle routing problem using clustering algorithm by maximum neural networks , 1999, Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296).

[14]  Philippe Lacomme,et al.  Competitive Memetic Algorithms for Arc Routing Problems , 2004, Ann. Oper. Res..

[15]  Le Song,et al.  A dependence maximization view of clustering , 2007, ICML '07.

[16]  Patrick J. F. Groenen,et al.  Modern Multidimensional Scaling: Theory and Applications , 2003 .

[17]  Qiang Yang,et al.  A Survey on Transfer Learning , 2010, IEEE Transactions on Knowledge and Data Engineering.

[18]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[19]  Ivor W. Tsang,et al.  A Family of Simple Non-Parametric Kernel Learning Algorithms , 2011, J. Mach. Learn. Res..

[20]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[21]  Richard W. Eglese,et al.  An Interactive Algorithm for Vehicle Routeing for Winter — Gritting , 1996 .

[22]  Yew-Soon Ong,et al.  A Probabilistic Memetic Framework , 2009, IEEE Transactions on Evolutionary Computation.

[23]  Hans-Peter Kriegel,et al.  Integrating structured biological data by Kernel Maximum Mean Discrepancy , 2006, ISMB.