Website
http://dataportal.arc.gov.au/NCGP/API/grants/DE140100017
Funding Status
Closed
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Funded Activity Summary
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.Funded Activity Details
Start Date: 01-2014
End Date: 12-2019
Funding Scheme: Discovery Early Career Researcher Award
Funding Amount: $394,800.00
Funder: Australian Research Council
Research Topics
ANZSRC Field of Research (FoR)
Neural, Evolutionary and Fuzzy Computation | Software Engineering | Artificial Intelligence and Image Processing
