Visualisation of Cost Landscapes in Combinatorial Optimisation Problems
published: Feb. 25, 2007, recorded: November 2005, views: 4563
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Understanding the structure of the cost landscape of optimisation problems is important for algorithm design. In this talk, I discuss one approach based on Barrier Trees which captures the structure of the local minima and barriers between minima for search spaces with up to 10^12 states. This structure allows visualisation of heuristic search strategies. Furthermore, the visualisation can be used to construct a model of the problem which captures many of the relevant features of the real problem, but with a vastly reduced number of states. The model can be used for investigating optimal heuristic strategies.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !