On the Life-Long Learning Capabilities of a NELLI*: A Hyper-Heuristic Optimisation System

Real-world applications of optimisation techniques place more importance on finding approaches that result in acceptable quality solutions in a short time-frame and can provide robust solutions, capable of being modified in response to changes in the environment than seeking elusive global optima. We demonstrate that a hyper-heuristic approach NELLI* that takes inspiration from artifical immune systems is capable of life-long learning in an environment where problems are presented in a continuous stream and change over time. Experiments using 1370 bin-packing problems show excellent performance on unseen problems and that the system maintains memory, enabling it to exploit previously learnt heuristics to solve new problems with similar characteristics to ones solved in the past.

[1]  David Jackson,et al.  Single Node Genetic Programming on Problems with Side Effects , 2012, PPSN.

[2]  Krzysztof Trojanowski,et al.  Immune-based algorithms for dynamic optimization , 2009, Inf. Sci..

[3]  Peter I. Cowling,et al.  Mining the data from a hyperheuristic approach using associative classification , 2008, Expert Syst. Appl..

[4]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[5]  Zbigniew Michalewicz Ubiquity symposium: Evolutionary computation and the processes of life: the emperor is naked: evolutionary algorithms for real-world applications , 2012, UBIQ.

[6]  Frédéric Saubion,et al.  Autonomous operator management for evolutionary algorithms , 2010, J. Heuristics.

[7]  Ian P. Gent Heuristic Solution of Open Bin Packing Problems , 1998, J. Heuristics.

[8]  Witold Pedrycz,et al.  Foundations of Fuzzy Logic and Soft Computing, 12th International Fuzzy Systems Association World Congress, IFSA 2007, Cancun, Mexico, June 18-21, 2007, Proceedings , 2007, IFSA.

[9]  Peter Ross,et al.  Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems , 2002, GECCO.

[10]  Ben Paechter,et al.  A Hyper-Heuristic Classifier for One Dimensional Bin Packing Problems: Improving Classification Accuracy by Attribute Evolution , 2012, PPSN.

[11]  Ben Paechter,et al.  A Lifelong Learning Hyper-heuristic Method for Bin Packing , 2015, Evolutionary Computation.

[12]  Ben Paechter,et al.  Learning to Solve Bin Packing Problems with an Immune Inspired Hyper-heuristic , 2013, ECAL.

[13]  Graham Kendall,et al.  Automating the Packing Heuristic Design Process with Genetic Programming , 2012, Evolutionary Computation.

[14]  Qiang Yang,et al.  Lifelong Machine Learning Systems: Beyond Learning Algorithms , 2013, AAAI Spring Symposium: Lifelong Machine Learning.

[15]  María Cristina Riff,et al.  Collaboration Between Hyperheuristics to Solve Strip-Packing Problems , 2007, IFSA.

[16]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

[17]  Vincenzo Cutello,et al.  Parallel Problem Solving from Nature - PPSN XII , 2012, Lecture Notes in Computer Science.

[18]  Emma Hart,et al.  Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model , 2013, GECCO '13.

[19]  Uwe Aickelin,et al.  Two-timescale learning using idiotypic behaviour mediation for a navigating mobile robot , 2010, Appl. Soft Comput..

[20]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[21]  Emma Hart,et al.  An improved immune inspired hyper-heuristic for combinatorial optimisation problems , 2014, GECCO.

[22]  Peter I. Cowling,et al.  An empirical study of hyperheuristics for managing very large sets of low level heuristics , 2012, J. Oper. Res. Soc..