Adaptive Optimisation of Complex Combinatorial Problems

点击翻译按钮获取中文摘要

One of the most common problems faced by planners, whether in industry or government, is optimisation, finding the optimal solution to a problem. Even a one per cent improvement in a solution can make a difference of millions of dollars in some cases. Traditionally optimisation problems are solved by analytic means or exact optimisation methods. Today, however, many optimisation problems involve complex combinatorial systems that make such traditional approaches unsuitable or intractable. This project aims to assist researchers and practitioners in solving complex combinatorial optimisation problems by adapting the optimisation strategy to the problem being solved, based on problem features such as search space difficulty.