Skip to main content

Research Repository

Advanced Search

All Outputs (21)

Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances (2024)
Presentation / Conference Contribution
Hart, E., Sim, K., & Renau, Q. (2024, September). Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances. Presented at 18th International Conference on Parallel Problem Solving From Nature PPSN 2024, Hagenburg, Austria

Deep neural networks (DNN) are increasingly being used to perform algorithm-selection in combinatorial optimisation domains, particularly as they accommodate input representations which avoid designing and calculating features. Mounting evidence fro... Read More about Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances.

A Feature-Free Approach to Automated Algorithm Selection (2023)
Presentation / Conference Contribution
Alissa, M., Sim, K., & Hart, E. (2023). A Feature-Free Approach to Automated Algorithm Selection. In GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation (9-10). https://doi.org/10.1145/3583133.3595832

This article summarises recent work in the domain of feature-free algorithm selection that was published in the Journal of Heuristics in January 2023, with the title 'Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches'. Spec... Read More about A Feature-Free Approach to Automated Algorithm Selection.

To Switch or not to Switch: Predicting the Benefit of Switching between Algorithms based on Trajectory Features (2023)
Presentation / Conference Contribution
Vermetten, D., Wang, H., Sim, K., & Hart, E. (2023, April). To Switch or not to Switch: Predicting the Benefit of Switching between Algorithms based on Trajectory Features. Presented at Evo Applications 2023, Brno, Czech Republic

Dynamic algorithm selection aims to exploit the complementarity of multiple optimization algorithms by switching between them during the search. While these kinds of dynamic algorithms have been shown to have potential to outperform their component a... Read More about To Switch or not to Switch: Predicting the Benefit of Switching between Algorithms based on Trajectory Features.

Evolutionary Approaches to Improving the Layouts of Instance-Spaces (2022)
Presentation / Conference Contribution
Sim, K., & Hart, E. (2022, September). Evolutionary Approaches to Improving the Layouts of Instance-Spaces. Presented at 17th International Conference, PPSN 2022, Dortmund, Germany

We propose two new methods for evolving the layout of an instance-space. Specifically we design three different fitness metrics that seek to: (i) reward layouts which place instances won by the same solver close in the space; (ii) reward layouts that... Read More about Evolutionary Approaches to Improving the Layouts of Instance-Spaces.

A Neural Approach to Generation of Constructive Heuristics (2021)
Presentation / Conference Contribution
Alissa, M., Sim, K., & Hart, E. (2021, June). A Neural Approach to Generation of Constructive Heuristics. Presented at IEEE Congress on Evolutionary Computation 2021, Kraków, Poland (online)

Both algorithm-selection methods and hyper-heuristic methods rely on a pool of complementary heuristics. Improving the pool with new heuristics can improve performance, however, designing new heuristics can be challenging. Methods such as genetic pro... Read More about A Neural Approach to Generation of Constructive Heuristics.

A Deep Learning Approach to Predicting Solutions in Streaming Optimisation Domains (2020)
Presentation / Conference Contribution
Alissa, M., Sim, K., & Hart, E. (2020, July). A Deep Learning Approach to Predicting Solutions in Streaming Optimisation Domains. Presented at GECCO ’20, Cancún, Mexico

In the field of combinatorial optimisation, per-instance algorithm selection still remains a challenging problem, particularly with respect to streaming problems such as packing or scheduling. Typical approaches involve training a model to predict th... Read More about A Deep Learning Approach to Predicting Solutions in Streaming Optimisation Domains.

Algorithm selection using deep learning without feature extraction (2019)
Presentation / Conference Contribution
Alissa, M., Sim, K., & Hart, E. (2019). Algorithm selection using deep learning without feature extraction. In GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion (198-206). https://doi.org/10.1145/3321707.3321845

We propose a novel technique for algorithm-selection which adopts a deep-learning approach, specifically a Recurrent-Neural Network with Long-Short-Term-Memory (RNN-LSTM). In contrast to the majority of work in algorithm-selection, the approach does... Read More about Algorithm selection using deep learning without feature extraction.

Applications of Evolutionary Computation (2018)
Presentation / Conference Contribution
(2018). Applications of Evolutionary Computation. In K. Sim, & P. Kaufmann (Eds.), Applications of Evolutionary Computation. https://doi.org/10.1007/978-3-319-77538-8

This book constitutes the refereed conference proceedings of the 21st International Conference on the Applications of Evolutionary Computation, EvoApplications 2018, held in Parma, Italy, in April 2018, collocated with the Evo* 2018 events EuroGP, Ev... Read More about Applications of Evolutionary Computation.

A new rich vehicle routing problem model and benchmark resource (2018)
Presentation / Conference Contribution
Sim, K., Hart, E., Urquhart, N. B., & Pigden, T. (2015, September). A new rich vehicle routing problem model and benchmark resource. Presented at International Conference on Evolutionary and Deterministic Methods for Design, Optimization and Control with Applications to Industrial and Societal Problems, EUROGEN-2015, University of Strathclyde, Glasgow

We describe a new rich VRP model that captures many real-world constraints, following a recently proposed taxonomy that addresses both scenario and problem physical characteristics. The model is used to generate 4800 new instances of rich VRPs which... Read More about A new rich vehicle routing problem model and benchmark resource.

Applications of Evolutionary Computation (2017)
Presentation / Conference Contribution
(2017). Applications of Evolutionary Computation. In G. Squillero, & K. Sim (Eds.), Applications of Evolutionary Computation (Part II). https://doi.org/10.1007/978-3-319-55792-2

The two volumes LNCS 10199 and 10200 constitute the refereed conference proceedings of the 20th European Conference on the Applications of Evolutionary Computation, EvoApplications 2017, held in Amsterdam, The Netherlands, in April 2017, colocated wi... Read More about Applications of Evolutionary Computation.

Applications of Evolutionary Computation (2017)
Presentation / Conference Contribution
(2017). Applications of Evolutionary Computation. In G. Squillero, & K. Sim (Eds.), Applications of Evolutionary Computation (Part I). https://doi.org/10.1007/978-3-319-55849-3

The two volumes LNCS 10199 and 10200 constitute the refereed conference proceedings of the 20th European Conference on the Applications of Evolutionary Computation, EvoApplications 2017, held in Amsterdam, The Netherlands, in April 2017, collocated w... Read More about Applications of Evolutionary Computation.

A hybrid method for feature construction and selection to improve wind-damage prediction in the forestry sector (2017)
Presentation / Conference Contribution
Hart, E., Sim, K., Gardiner, B., & Kamimura, K. (2017, July). A hybrid method for feature construction and selection to improve wind-damage prediction in the forestry sector. Presented at Proceedings of the Genetic and Evolutionary Computation Conference on - GECCO '17

Catastrophic damage to forests resulting from major storms has resulted in serious timber and financial losses within the sector across Europe in the recent past. Developing risk assessment methods is thus one of the keys to finding forest management... Read More about A hybrid method for feature construction and selection to improve wind-damage prediction in the forestry sector.

A Novel Heuristic Generator for JSSP Using a Tree-Based Representation of Dispatching Rules (2015)
Presentation / Conference Contribution
Sim, K., & Hart, E. (2015, July). A Novel Heuristic Generator for JSSP Using a Tree-Based Representation of Dispatching Rules. Presented at Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference - GECCO Companion '15

A previously described hyper-heuristic framework named NELLI is adapted for the classic Job Shop Scheduling Problem (JSSP) and used to find ensembles of reusable heuristics that cooperate to cover the heuristic search space. A new heuristic generato... Read More about A Novel Heuristic Generator for JSSP Using a Tree-Based Representation of Dispatching Rules.

Genetic Programming (2015)
Presentation / Conference Contribution
Machado, P., Heywood, M. I., McDermott, J., Castelli, M., García-Sánchez, P., Burelli, P., …Sim, K. (2015). Genetic Programming. In Genetic Programming. https://doi.org/10.1007/978-3-319-16501-1

The 18th European Conference on Genetic Programming (EuroGP) took place during April 8–10, 2015. Copenhagen, Denmark was the setting, and the Nationalmuseet was the venue. EuroGP is the only conference exclusively devoted to the evolutionary gener... Read More about Genetic Programming.

A research agenda for metaheuristic standardization. (2015)
Presentation / Conference Contribution
Hart, E., & Sim, K. (2015, June). A research agenda for metaheuristic standardization. Paper presented at 11th Metaheuristics International Conference

We propose that the development of standardized, explicit, machine-readable descriptions of metaheuris- tics will greatly advance scientific progress in the field. In particular, we advocate a purely functional description of metaheuristics — separat... Read More about A research agenda for metaheuristic standardization..

On the life-long learning capabilities of a NELLI*: a hyper-heuristic optimisation system. (2014)
Presentation / Conference Contribution
Hart, E., & Sim, K. (2014, September). 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... Read More about On the life-long learning capabilities of a NELLI*: a hyper-heuristic optimisation system..

An improved immune inspired hyper-heuristic for combinatorial optimisation problems. (2014)
Presentation / Conference Contribution
Sim, K., & Hart, E. (2014, July). An improved immune inspired hyper-heuristic for combinatorial optimisation problems

The meta-dynamics of an immune-inspired optimisation sys- tem NELLI are considered. NELLI has previously shown to exhibit good performance when applied to a large set of optimisation problems by sustaining a network of novel heuristics. We address th... Read More about An improved immune inspired hyper-heuristic for combinatorial optimisation problems..

A real-world employee scheduling and routing application. (2014)
Presentation / Conference Contribution
Hart, E., Sim, K., & Urquhart, N. B. (2014, July). A real-world employee scheduling and routing application. Presented at GECCO 2014

We describe a hyper-heuristic application developed for a client to find quick, acceptable solutions to Workforce Schedul- ing and Routing problems. An interactive fitness function controlled by the user enables five different objectives to be weight... Read More about A real-world employee scheduling and routing application..

Learning to solve bin packing problems with an immune inspired hyper-heuristic. (2013)
Presentation / Conference Contribution
Sim, K., Hart, E., & Paechter, B. (2013, September). Learning to solve bin packing problems with an immune inspired hyper-heuristic

Motivated by the natural immune system's ability to defend the body by generating and maintaining a repertoire of antibodies that collectively cover the potential pathogen space, we describe an artificial system that discovers and maintains a reperto... Read More about Learning to solve bin packing problems with an immune inspired hyper-heuristic..

Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model. (2013)
Presentation / Conference Contribution
Sim, K., & Hart, E. (2013, July). Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model. Presented at 15th annual conference on Genetic and evolutionary computation

Novel deterministic heuristics are generated using Single Node Genetic Programming for application to the One Dimensional Bin Packing Problem. First a single deterministic heuristic was evolved that minimised the total number of bins used when applie... Read More about Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model..