Skip to main content

Research Repository

Advanced Search

All Outputs (3)

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