A number of hybrid metaheuristics are presented based on GRASP, path relinking and PROBE. Instantiations of the resulting metaheuristics are described for the graph bisection problem. Experimental results are given which indicate that a metaheuristic resulting from the hybridization of all three of the above techniques can lead to computationally efficient and robust solution methods.
|Number of pages||10|
|Publication status||Published - Aug 2004|
|Event||Workshop on Hybrid Metaheuristics, ECAI 2004 - Valencia, Spain|
Duration: 22 Aug 2004 → 23 Aug 2004
|Conference||Workshop on Hybrid Metaheuristics, ECAI 2004|
|Period||22/08/04 → 23/08/04|