Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches
Journal Article
Alissa, M., Sim, K., & Hart, E. (in press)
Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches. Journal of Heuristics, https://doi.org/10.1007/s10732-022-09505-4
We propose a novel technique for algorithm-selection, applicable to optimisation domains in which there is implicit sequential information encapsulated in the data, e.g., in o...
Evolutionary Approaches to Improving the Layouts of Instance-Spaces
Conference Proceeding
Sim, K., & Hart, E. (2022)
Evolutionary Approaches to Improving the Layouts of Instance-Spaces. In Parallel Problem Solving from Nature – PPSN XVII. PPSN 2022 (207-219). https://doi.org/10.1007/978-3-031-14714-2_15
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 in...
Minimising line segments in linear diagrams is NP-hard
Journal Article
Chapman, P., Sim, K., & Hao Chen, H. (2022)
Minimising line segments in linear diagrams is NP-hard. Journal of Computer Languages, 71, Article 101136. https://doi.org/10.1016/j.cola.2022.101136
Linear diagrams have been shown to be an effective method of representing set-based data. Moreover, a number of guidelines have been proven to improve the efficacy of linear d...
A Deep Learning Approach to Predicting Solutions in Streaming Optimisation Domains
Conference Proceeding
Alissa, M., Sim, K., & Hart, E. (2020)
A Deep Learning Approach to Predicting Solutions in Streaming Optimisation Domains. . https://doi.org/10.1145/3377930.3390224
In the field of combinatorial optimisation, per-instance algorithm selection still remains a challenging problem, particularly with respect to streaming problems such as packi...