Skip to main content

Research Repository

Advanced Search

Landscape features and automated algorithm selection for multi-objective interpolated continuous optimisation problems. (2021)
Conference Proceeding
LIEFOOGHE, A., VEREL, S., LACROIX, B., ZĂVOIANU, A.-C. and MCCALL, J. 2021. Landscape features and automated algorithm selection for multi-objective interpolated continuous optimisation problems. In Chicano, F. (ed) Proceedings of 2021 Genetic and evolutionary computation conference (GECCO 2021), 10-14 July 2021, [virtual conference]. New York: ACM [online], pages 421-429. Available from: https://doi.org/10.1145/3449639.3459353

In this paper, we demonstrate the application of features from landscape analysis, initially proposed for multi-objective combinatorial optimisation, to a benchmark set of 1 200 randomly-generated multiobjective interpolated continuous optimisation p... Read More about Landscape features and automated algorithm selection for multi-objective interpolated continuous optimisation problems..

Ensemble-based relationship discovery in relational databases. (2020)
Conference Proceeding
OGUNSEMI, A., MCCALL, J., KERN, M., LACROIX, B., CORSAR, D. and OWUSU, G. 2020. Ensemble-based relationship discovery in relational databases. In Bramer, M. and Ellis, R. (eds.) Artificial intelligence XXXVII: proceedings of 40th British Computer Society's Specialist Group on Artificial Intelligence (SGAI) Artificial intelligence international conference 2020 (AI-2020), 15-17 December 2020, [virtual conference]. Lecture notes in artificial intelligence, 12498. Cham: Springer [online], pages 286-300. Available from: https://doi.org/10.1007/978-3-030-63799-6_22

We performed an investigation of how several data relationship discovery algorithms can be combined to improve performance. We investigated eight relationship discovery algorithms like Cosine similarity, Soundex similarity, Name similarity, Value ran... Read More about Ensemble-based relationship discovery in relational databases..

Comparative run-time performance of evolutionary algorithms on multi-objective interpolated continuous optimisation problems. (2020)
Conference Proceeding
ZĂVOIANU, A.-C., LACROIX, B. and MCCALL, J. 2020. Comparative run-time performance of evolutionary algorithms on multi-objective interpolated continuous optimisation problems. In Bäck, T., Preuss, M., Deutz, A., Wang, H., Doerr, C., Emmerich, M. and Trautmann, H. (eds.) Parallel problem solving from nature: PPSN XVI: proceedings of the 16th Parallel problem solving from nature international conference (PPSN 2020), 5-9 September 2020, Leiden, The Netherlands. Lecture notes in computer science, 12269. Cham; Springer, part 1, pages 287-300. Available from: https://doi.org/10.1007/978-3-030-58112-1_20

We propose a new class of multi-objective benchmark problems on which we analyse the performance of four well established multi-objective evolutionary algorithms (MOEAs) – each implementing a different search paradigm – by comparing run-time converge... Read More about Comparative run-time performance of evolutionary algorithms on multi-objective interpolated continuous optimisation problems..

Racing strategy for the dynamic-customer location-allocation problem. (2020)
Conference Proceeding
ANKRAH, R., LACROIX, B., MCCALL, J., HARDWICK, A., CONWAY, A. and OWUSU, G. 2020. Racing strategy for the dynamic-customer location-allocation problem. In Proceedings of 2020 Institute of Electrical and Electronics Engineers (IEEE) congress on evolutionary computation (IEEE CEC 2020), part of the 2020 (IEEE) World congress on computational intelligence (IEEE WCCI 2020) and co-located with the 2020 International joint conference on neural networks (IJCNN 2020) and the 2020 IEEE International fuzzy systems conference (FUZZ-IEEE 2020), 19-24 July 2020, Glasgow, UK [virtual conference]. Piscataway: IEEE [online], article 9185918. Available from: https://doi.org/10.1109/CEC48606.2020.9185918

In previous work, we proposed and studied a new dynamic formulation of the Location-allocation (LA) problem called the Dynamic-Customer Location-allocation (DC-LA) prob­lem. DC-LA is based on the idea of changes in customer distribution over a define... Read More about Racing strategy for the dynamic-customer location-allocation problem..