Skip to main content

Research Repository

Advanced Search

Mr Joan Alza Santos


On the elusivity of dynamic optimisation problems. (2023)
Journal Article
ALZA, J., BARTLETT, M., CEBERIO, J. and MCCALL, J. 2023. On the elusivity of dynamic optimisation problems. Swarm and evolutionary computation [online], 78, article 101289. Available from: https://doi.org/10.1016/j.swevo.2023.101289

The field of dynamic optimisation continuously designs and compares algorithms with adaptation abilities that deal with changing problems during their search process. However, restarting the search algorithm after a detected change is sometimes a bet... Read More about On the elusivity of dynamic optimisation problems..

Analysing the fitness landscape rotation for combinatorial optimisation. (2022)
Conference Proceeding
ALZA, J., BARTLETT, M., CEBERIO, J. and MCCALL, J. 2022. Analysing the fitness landscape rotation for combinatorial optimisation. In Rudolph, G., Kononova, A.V., Aguirre, H., Kerschke, P., Ochoa, G. and Tušar, T. (eds.) Parallel problem solving from nature (PPSN XVII): proceedings of 17th Parallel problem solving from nature international conference 2022 (PPSN 2022), 10-14 September 2022, Dortmund, Germany. Lecture notes in computer science, 13398. Cham: Springer [online], pages 533-547. Available from: https://doi.org/10.1007/978-3-031-14714-2_37

Fitness landscape rotation has been widely used in the field of dynamic combinatorial optimisation to generate test problems with academic purposes. This method changes the mapping between solutions and objective values, but preserves the structure o... Read More about Analysing the fitness landscape rotation for combinatorial optimisation..

Towards the landscape rotation as a perturbation strategy on the quadratic assignment problem. (2021)
Conference Proceeding
ALZA, J., BARTLETT, M., CEBERIO, J. and MCCALL, J. 2021. Towards the landscape rotation as a perturbation strategy on the quadratic assignment problem. In Chicano, F. (ed.) GECCO '21: proceedings of 2021 Genetic and evolutionary computation conference companion, 10-14 July 2021, [virtual conference]. New York: ACM [online], pages 1405-1413. Available from: https://doi.org/10.1145/3449726.3463139

Recent work in combinatorial optimisation have demonstrated that neighbouring solutions of a local optima may belong to more favourable attraction basins. In this sense, the perturbation strategy plays a critical role on local search based algorithms... Read More about Towards the landscape rotation as a perturbation strategy on the quadratic assignment problem..

On the definition of dynamic permutation problems under landscape rotation. (2019)
Conference Proceeding
ALZA, J., BARTLETT, M., CEBERIO, J. and MCCALL, J. 2019. On the definition of dynamic permutation problems under landscape rotation. In López-Ibáñez, M. (ed.) Proceedings of the 2019 Genetic and evolutionary computation conference companion (GECCO 2019), 13-17 July 2019, Prague, Czech Republic. New York: ACM [online], pages 1518-1526. Available from: https://doi.org/10.1145/3319619.3326840

Dynamic optimisation problems (DOPs) are optimisation problems that change over time. Typically, DOPs have been defined as a sequence of static problems, and the dynamism has been inserted into existing static problems using different techniques. In... Read More about On the definition of dynamic permutation problems under landscape rotation..