Integrating neural networks and logistic regression to underpin hyper-heuristic search

A hyper-heuristic often represents a heuristic search method that operates over a space of heuristic rules. It can be thought of as a high level search methodology to choose lower level heuristics. Nearly 200 papers on hyper-heuristics have recently appeared in the literature. A common theme in this body of literature is an attempt to solve the problems in hand in the following way: at each decision point, first employ the chosen heuristic(s) to generate a solution, then calculate the objective value of the solution by taking into account all the constraints involved. However, empirical studies from our previous research have revealed that, under many circumstances, there is no need to carry out this costly 2-stage determination and evaluation at all times. This is because many problems in the real world are highly constrained with the characteristic that the regions of feasible solutions are rather scattered and small. Motivated by this observation and with the aim of making the hyper-heuristic search more efficient and more effective, this paper investigates two fundamentally different data mining techniques, namely artificial neural networks and binary logistic regression. By learning from examples, these techniques are able to find global patterns hidden in large data sets and achieve the goal of appropriately classifying the data. With the trained classification rules or estimated parameters, the performance (i.e. the worth of acceptance or rejection) of a resulting solution during the hyper-heuristic search can be predicted without the need to undertake the computationally expensive 2-stage of determination and calculation. We evaluate our approaches on the solutions (i.e. the sequences of heuristic rules) generated by a graph-based hyper-heuristic proposed for exam timetabling problems. Time complexity analysis demonstrates that the neural network and the logistic regression method can speed up the search significantly. We believe that our work sheds light on the development of more advanced knowledge-based decision support systems.

[1]  Yoram Singer,et al.  Logistic Regression, AdaBoost and Bregman Distances , 2000, Machine Learning.

[2]  Raymond S. K. Kwan Bus and Train Driver Scheduling , 2004, Handbook of Scheduling.

[3]  Edmund K. Burke,et al.  Applications to timetabling , 2004 .

[4]  Sanja Petrovic,et al.  A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..

[5]  Ismail Hakki Toroslu,et al.  Concept discovery on relational databases: New techniques for search space pruning and rule quality improvement , 2010, Knowl. Based Syst..

[6]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[7]  Subbarao Kambhampati,et al.  Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search , 2002, Artif. Intell..

[8]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[9]  Peter Ross,et al.  Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics , 2003, GECCO.

[10]  Gilbert Laporte,et al.  Examination Timetabling: Algorithmic Strategies and Applications , 1994 .

[11]  R. D. Murphy,et al.  Iterative solution of nonlinear equations , 1994 .

[12]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[13]  Edmund K. Burke,et al.  Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems , 2009, J. Oper. Res. Soc..

[14]  Chih-Jen Lin,et al.  Coordinate Descent Method for Large-scale L2-loss Linear Support Vector Machines , 2008, J. Mach. Learn. Res..

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

[16]  Hamparsum Bozdogan,et al.  Statistical Data Mining and Knowledge Discovery , 2004 .

[17]  Simon Haykin,et al.  Neural Networks: A Comprehensive Foundation , 1998 .

[18]  Edmund K. Burke,et al.  A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems , 2010, Eur. J. Oper. Res..

[19]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[20]  Graham Kendall,et al.  A Classification of Hyper-heuristic Approaches , 2010 .

[21]  Sanja Petrovic,et al.  Case-based heuristic selection for timetabling problems , 2006, J. Sched..

[22]  Geoffrey E. Hinton,et al.  Learning internal representations by error propagation , 1986 .

[23]  Yanchun Zhang,et al.  A robust iterative refinement clustering algorithm with smoothing search space , 2010, Knowl. Based Syst..

[24]  Reha Uzsoy,et al.  Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach , 2006, J. Sched..

[25]  James L. McClelland,et al.  Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

[26]  Raymond S. K. Kwan,et al.  Distributed Choice Function Hyper-heuristics for Timetabling and Scheduling , 2004, PATAT.

[27]  Uwe Aickelin,et al.  An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering , 2007, J. Oper. Res. Soc..

[28]  Thomas G. Dietterich What is machine learning? , 2020, Archives of Disease in Childhood.

[29]  George L. Nemhauser,et al.  Sports Scheduling , 2004, Handbook of Scheduling.

[30]  Edmund K. Burke,et al.  A survey of search methodologies and automated system development for examination timetabling , 2009, J. Sched..

[31]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[32]  Andrew Lim,et al.  Nurse rostering problems - a bibliographic survey , 2003, Eur. J. Oper. Res..

[33]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[34]  Edmund K. Burke,et al.  A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation , 2007, Eur. J. Oper. Res..

[35]  J. Aldrich R.A. Fisher and the making of maximum likelihood 1912-1922 , 1997 .

[36]  Sanja Petrovic,et al.  University Timetabling , 2004, Handbook of Scheduling.

[37]  Uwe Aickelin,et al.  An estimation of distribution algorithm for nurse scheduling , 2007, Ann. Oper. Res..

[38]  Cho-Jui Hsieh,et al.  Coordinate Descent Method for Large-scale L 2-loss Linear SVM , 2008 .

[39]  A. Agresti An introduction to categorical data analysis , 1997 .

[40]  Alexandre Plastino,et al.  Applications of the DM-GRASP heuristic: a survey , 2008, Int. Trans. Oper. Res..