** Apologies for cross-posting **

Stream on Hyper-heuristics
Abstract submission deadline:  February 8, 2019  

Call for Abstracts (Max. 1500 characters):

Session on Selection Hyper-heuristics (Submission Code: 39acc144)
Session on Generation Hyper-heuristics (Submission Code: ffd15a62)  

Hyper-heuristics are problem-independent generic solvers which have been successfully applied to a wide range of combinatorial search problems both from academia and real-world, such as timetabling, scheduling, routing, rostering, cutting and packing. The studies on this field is mainly considered under two categories, namely Selection and Generation Hyper-heuristics. Selection Hyper-heuristics operate by automatically choosing (low-level) heuristics from an existing heuristic set while the latter type focuses on generating heuristics from scratch based on predefined components. This stream is expecting studies focusing on either of these hyper-heuristic types -offering different learning approaches, utilizing distinct (meta-) heuristic techniques while dealing with various problems.


- Prof. Patrick De Causmaecker, KU Leuven, Belgium
- Dr. Mustafa Misir, Nanjing University of Aeronautics and Astronautics, China
- Dr. Ender Ozcan, University of Nottingham, UK
- Dr. Rong Qu, University of Nottingham, UK 

Important Dates:

    Abstract Submission Deadline: February 8, 2019
    Early Registration Deadline: March 8, 2019
    Late Registration Deadline: March 22, 2019

Best regards,

Patrick, Mustafa, Ender, Rong


Mustafa MISIR

Machine lEarning and Operations Research (MEmORy) Lab
Institute of Machine Learning and Computational Intelligence
College of Computer Science and Technology, Office: 230
Nanjing University of Aeronautics and Astronautics
29 Jiangjun Road, Jiangning, 211106 Nanjing/Jiangsu, China



To unsubscribe from the META-HEURISTICS list, click the following link: