Output details
11 - Computer Science and Informatics
University of Greenwich
Multilevel refinement for combinatorial optimisation: boosting metaheuristic performance
This paper describes our body of work relating to an emerging area of optimisation. Since 2000 I have been working to generalise and extend multilevel refinement from a well-known, but restricted, graph-partitioning technique into a general optimisation paradigm, suitable for many other hard mathematical problems. I have demonstrated its effectiveness for the graph layout, travelling salesman & graph-colouring problems and, in collaboration with a PhD student (Demane Rodney), for the vehicle routing & capacitated clustering problems. My latest PhD student (Carl Crawford) continues this work with investigations into the graph layout problem. 21 citations.