School of Engineering and Information Technology

Real-time routing and tracking require different optimization algorithms from their offline counterparts. Another name to real-time is time-constrained problems, where a solution is needed within a constrained – and normally shorter – timeframe. Here, traditional offline optimization algorithms that rely on heavy computations and long time to reach an optimal solution fail to deliver high quality solutions in a time-constrained environment. Moreover, when faced with a real-time problem, it is common that the full problem is not known in advance. For example, parameter values may not be available in advance, they may change during the course of solving the problem, and some variables may become more relevant or even redundant. This imposes a challenge that is not normally the focus of traditional offline optimization algorithms. This project focuses on developing novel optimization algorithms for this class of problems.