Evolutionary Computation for Dynamic Optimisation in Network Environments
The research on optimisation problems in network environments has a long history, but it generally fails to capture real-world scenarios as it usually assumes that both the network environments (such as network topologies, node processing capabilities, interference, etc. and the optimisation problems (such as the user requirements) are known in advance and remain unchanged in the problem-solving procedure. However, most real-world network optimisation problems (NOPs) are highly dynamic, where the network topologies, availability of resources, interference factors, user requirements, etc., are unpredictable, change with time, and/or are unknown a priori. This poses many difficulties for decision makers, generating significant optimisation challenges. Our research aims to investigate Dynamic NOPs (DNOPs) in various network environments, such as communication networks, transport networks, social networks, and financial networks.
Evolutionary Computation (EC) has been successfully applied to many real world scenarios, especially for difficult and challenging problems and those problems that are difficult to define precisely. This project aims to investigate EC methods for solving DNOPs. We aim to gain insight and further our understanding of how different EC methods can be applied to DNOPs via empirical and theoretical studies. It is important to carry out this research at both theoretical and empirical levels, as one can feed into the other.
In order to test and evaluate our newly developed algorithms for DNOPs, we are developing a set of common DNOP models that capture the real-world complexities, and develop advanced EC methods to solve these DNOP models. This will benefit wider research communities due to the ubiquity of DNOPs in so many different fields from communication networks to transport networks to social networks to financial networks.