|
|
|
|
|
|
Help | Seminars List | Add Seminar | Edit Seminars | Tips for organisers | RSS | ics Calendar | Search | Send comments about this website to seminar-master@cecs.anu.edu.au
Contact: Michelle.Moravec@anu.edu.au CS PHD MONITORING Mini session in November
Ejection Chain Methods For Solving TSPsMr Daniel Harabor (School of Computer Science)DATE: 2009-11-10 TIME: 13:30:00 - 14:00:00 LOCATION: RSISE Seminar Room, ground floor, building 115, cnr. North and Daley Roads, ANU ABSTRACT: An ejection chain is a special kind of move operator used in local search to explore a neighbourhood. Ejection chains are interesting because of their ability to cross infeasible regions of the search space and connect otherwise non-adjacent neighbourhoods. For this reason, ejection chain methods are among the most competitive algorithms for solving a wide range of classical computer science and operations research problems.
In this talk I will provide an introduction to ejection chain methods with particular emphasis on their application
to solving the Traveling Salesman Problem (TSP). I will then outline some proposed research directions which involve using
a spanning-tree heuristic to guide the construction of ejection chains.
|