Skip to main content

previous disabled Page of 5
and
  1. Article

    Open Access

    Search graph structure and its implications for multi-graph constrained routing and scheduling problems

    Multi-graphs where several edges connect a pair of nodes are an important modelling approach for many real-world optimisation problems. The multi-graph structure is often based on infrastructure and available ...

    Michal Weiszer, Edmund K. Burke, Jun Chen in Scientific Reports (2022)

  2. Article

    Open Access

    A systematic approach to parameter optimization and its application to flight schedule simulation software

    Industrial software often has many parameters that critically impact performance. Frequently, these are left in a sub-optimal configuration for a given application because searching over possible configuration...

    Alexander E. I. Brownlee, Michael G. Epitropakis, Jeroen Mulder in Journal of Heuristics (2022)

  3. Article

    Open Access

    Preface: The practice and theory of automated timetabling (2018)

    Ender Özcan, Edmund K. Burke, Luca Di Gaspero in Annals of Operations Research (2021)

  4. No Access

    Article

    The practice and theory of automated timetabling (2016)

    Ender Özcan, Edmund K. Burke, Luca Di Gaspero in Annals of Operations Research (2019)

  5. No Access

    Chapter

    A Classification of Hyper-Heuristic Approaches: Revisited

    Hyper-heuristics comprise a set of approaches that aim to automate the development of computational search methodologies. This chapter overviews previous categorisations of hyper-heuristics and provides a unif...

    Edmund K. Burke, Matthew R. Hyde, Graham Kendall in Handbook of Metaheuristics (2019)

  6. No Access

    Reference Work Entry In depth

    Hyper-heuristics

    This chapter presents a literature review of the main advances in the field of hyper-heuristics, since the publication of a survey paper in 2013. The chapter demonstrates the most recent advances in hyper-heur...

    Michael G. Epitropakis, Edmund K. Burke in Handbook of Heuristics (2018)

  7. No Access

    Chapter and Conference Paper

    Late Acceptance Hill Climbing for Constrained Covering Arrays

    The Late Acceptance Hill-Climbing (LAHC) algorithm is a one-point search meta-heuristic with a single parameter. Like Simulated Annealing (SA) it sometimes accepts worsening moves, however it is far more simpl...

    Mosab Bazargani, John H. Drake, Edmund K. Burke in Applications of Evolutionary Computation (2018)

  8. No Access

    Living Reference Work Entry In depth

    Hyper-heuristics

    This chapter presents a literature review of the main advances in the field of hyper-heuristics, since the publication of a survey paper in 2013. The chapter demonstrates the most recent advances in hyper-heur...

    Michael G. Epitropakis, Edmund K. Burke in Handbook of Heuristics

  9. Article

    Preface

    Ender Özcan, Edmund K. Burke, Barry McCollum in Annals of Operations Research (2017)

  10. No Access

    Chapter and Conference Paper

    An Iterated Local Search Framework with Adaptive Operator Selection for Nurse Rostering

    Considerable attention has been paid to selective hyper-heuristic frameworks for addressing computationally hard scheduling problems. By using selective hyper-heuristics, we can derive benefits from the streng...

    Angeliki Gretsista, Edmund K. Burke in Learning and Intelligent Optimization (2017)

  11. No Access

    Article

    The Practice and Theory of Automated Timetabling (2012)

    Ender Özcan, Edmund K. Burke, Barry McCollum, Dag Kjenstad in Annals of Operations Research (2016)

  12. No Access

    Chapter and Conference Paper

    The Multi-Funnel Structure of TSP Fitness Landscapes: A Visual Exploration

    We use the Local Optima Network model to study the structure of symmetric TSP fitness landscapes. The ‘big-valley’ hypothesis holds that for TSP and other combinatorial problems, local optima are not randomly ...

    Gabriela Ochoa, Nadarajen Veerapen, Darrell Whitley in Artificial Evolution (2016)

  13. Article

    Comments on: An overview of curriculum-based course timetabling

    Edmund K. Burke, John H. Drake, Barry McCollum, Ender Özcan in TOP (2015)

  14. No Access

    Article

    On parallel local search for permutations

    We investigate some ways in which massively parallel computing devices can be exploited in local search algorithms. We show that the substantial speedups that can be gained from parallel neighbourhood evaluati...

    Atle Riise, Edmund K Burke in Journal of the Operational Research Society (2015)

  15. Article

    Journal of Scheduling (2015)

    Edmund K. Burke, Michael Pinedo in Journal of Scheduling (2015)

  16. No Access

    Chapter and Conference Paper

    Modified Choice Function Heuristic Selection for the Multidimensional Knapsack Problem

    Hyper-heuristics are a class of high-level search methods used to solve computationally difficult problems, which operate on a search space of low-level heuristics rather than solutions directly. Previous work...

    John H. Drake, Ender Özcan, Edmund K. Burke in Genetic and Evolutionary Computing (2015)

  17. No Access

    Article

    An analysis of constructive algorithms for the airport baggage sorting station assignment problem

    The assignment of airport resources can significantly affect the quality of service provided by airlines and airports. High quality assignments can support airlines and airports in adhering to published schedu...

    Amadeo Ascó, Jason A. D. Atkin, Edmund K. Burke in Journal of Scheduling (2014)

  18. No Access

    Article

    A more realistic approach for airport ground movement optimisation with stand holding

    In addition to having to handle constantly increasing numbers of aircraft, modern airports also have to address a wide range of environmental regulations and requirements. As airports work closer and closer to...

    Stefan Ravizza, Jason A. D. Atkin, Edmund K. Burke in Journal of Scheduling (2014)

  19. Article

    Open Access

    Unified encoding for hyper-heuristics with application to bioinformatics

    This paper introduces a new approach to applying hyper-heuristic algorithms to solve combinatorial problems with less effort, taking into account the modelling and algorithm construction process. We propose a ...

    Aleksandra Swiercz, Edmund K. Burke in Central European Journal of Operations Res… (2014)

  20. Article

    The practice and theory of automated timetabling

    Barry McCollum, Edmund K. Burke in Annals of Operations Research (2014)

previous disabled Page of 5