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
ZAVOIANU, 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..

Generation and optimisation of real-world static and dynamic location-allocation problems with application to the telecommunications industry. (2019)
Thesis
ANKRAH, R.B. 2019. Generation and optimisation of real-world static and dynamic location-allocation problems with application to the telecommunications industry. Robert Gordon University [online], PhD thesis. Available from: https://openair.rgu.ac.uk

The location-allocation (LA) problem concerns the location of facilities and the allocation of demand, to minimise or maximise a particular function such as cost, profit or a measure of distance. Many formulations of LA problems have been presented i... Read More about Generation and optimisation of real-world static and dynamic location-allocation problems with application to the telecommunications industry..

Introducing the dynamic customer location-allocation problem. (2019)
Conference Proceeding
ANKRAH, R., LACROIX, B., MCCALL, J., HARDWICK, A. and CONWAY, A. 2019. Introducing the dynamic customer location-allocation problem. In Proceedings of the 2019 Institute of Electrical and Electronics Engineers (IEEE) Congress on evolutionary computation (IEEE CEC 2019), 10-13 June 2019, Wellington, NZ. Piscataway: IEEE [online], pages 3157-3164. Available from: https://doi.org/10.1109/CEC.2019.8790150

In this paper, we introduce a new stochastic Location-Allocation Problem which assumes the movement of customers over time. We call this new problem Dynamic Customer Location-Allocation Problem (DC-LAP). The problem is based on the idea that customer... Read More about Introducing the dynamic customer location-allocation problem..

Limitations of benchmark sets and landscape features for algorithm selection and performance prediction. (2019)
Conference Proceeding
LACROIX, B. and MCCALL, J. 2019. Limitations of benchmark sets and landscape features for algorithm selection and performance prediction. In López-Ibáñe, M. (ed.) Proceedings of the 2019 Genetic and evolutionary computation conference (GECCO 2019) companion, 13-17 July 2019, Prague, Czech Republic. New York: Association for Computing Machinery [online], pages 261-262. Available from: https://doi.org/10.1145/3319619.3322051

Benchmark sets and landscape features are used to test algorithms and to train models to perform algorithm selection or configuration. These approaches are based on the assumption that algorithms have similar performances on problems with similar fea... Read More about Limitations of benchmark sets and landscape features for algorithm selection and performance prediction..

A holistic metric approach to solving the dynamic location-allocation problem. (2018)
Conference Proceeding
ANKRAH, R., LACROIX, B., MCCALL, J., HARDWICK, A. and CONWAY, A. 2018. A holistic metric approach to solving the dynamic location-allocation problem. In Bramer, M. and Petridis, M. (eds.) Artificial intelligence xxxv: proceedings of the 38th British Computer Society's Specialist Group on Artificial Intelligence (SGAI) International conference on innovative techniques and applications of artificial intelligence (AI-2018), 11-13 December 2018, Cambridge, UK. Lecture notes in artificial intelligence, 11311. Cham: Springer [online], pages 433-439. Available from: https://doi.org/10.1007/978-3-030-04191-5_35

In this paper, we introduce a dynamic variant of the Location-Allocation problem: Dynamic Location-Allocation Problem (DULAP). DULAP involves the location of facilities to service a set of customer demands over a defined horizon. To evaluate a soluti... Read More about A holistic metric approach to solving the dynamic location-allocation problem..

Iterated racing algorithm for simulation-optimisation of maintenance planning. (2018)
Conference Proceeding
LACROIX, B., MCCALL, J. and LONCHAMPT, J. 2018. Iterated racing algorithm for simulation-optimisation of maintenance planning. In Proceedings of the 2018 IEEE congress on evolutionary computation (CEC 2018), 8-13 July 2018, Rio de Janeiro, Brazil. Piscataway, NJ: IEEE [online], article number 8477843. Available from: https://doi.org/10.1109/CEC.2018.8477843

The purpose of this paper is two fold. First, we present a set of benchmark problems for maintenance optimisation called VMELight. This model allows the user to define the number of components in the system to maintain and a number of customisable pa... Read More about Iterated racing algorithm for simulation-optimisation of maintenance planning..

Simulation and optimisation of the separation process in offshore oil and gas platforms. (2017)
Thesis
VELESHKI, S. 2017. Simulation and optimisation of the separation process in offshore oil and gas platforms. Robert Gordon University, MRes thesis.

Hydrocarbon separation in offshore oil and gas platforms is the process that transforms extracted crude oil into transportable oil and gas. Temperatures and pressures of the separation system can be adjusted to modify the separation of the hydrocarbo... Read More about Simulation and optimisation of the separation process in offshore oil and gas platforms..

Region-based memetic algorithm with archive for multimodal optimisation. (2016)
Journal Article
LACROIX, B., MOLINA, D. and HERRERA, F. 2016. Region-based memetic algorithm with archive for multimodal optimisation. Information sciences [online], 367-368, pages 719-746. Available from: https://doi.org/10.1016/j.ins.2016.05.049

In this paper we propose a specially designed memetic algorithm for multimodal optimisation problems. The proposal uses a niching strategy, called region-based niching strategy, that divides the search space in predefined and indexable hypercubes wit... Read More about Region-based memetic algorithm with archive for multimodal optimisation..