Hybridizing GRASP, PROBE and Path Relinking

P. Chardaire; G. P. McKeown; J. A. Maki

Hybridizing GRASP, PROBE and Path Relinking

P. Chardaire, G. P. McKeown, J. A. Maki

School of Computing Sciences

Research output: Contribution to conference › Paper

Abstract

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.

Original language	English
Pages	91-100
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

Workshop

Workshop	Workshop on Hybrid Metaheuristics, ECAI 2004
Country/Territory	Spain
City	Valencia
Period	22/08/04 → 23/08/04

Cite this

@conference{aa312455e8f8400c901648a4ae07ddc5,

title = "Hybridizing GRASP, PROBE and Path Relinking",

abstract = "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.",

author = "P. Chardaire and McKeown, {G. P.} and Maki, {J. A.}",

year = "2004",

month = aug,

language = "English",

pages = "91--100",

note = "Workshop on Hybrid Metaheuristics, ECAI 2004 ; Conference date: 22-08-2004 Through 23-08-2004",

}

TY - CONF

T1 - Hybridizing GRASP, PROBE and Path Relinking

AU - Chardaire, P.

AU - McKeown, G. P.

AU - Maki, J. A.

PY - 2004/8

Y1 - 2004/8

N2 - 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.

AB - 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.

M3 - Paper

SP - 91

EP - 100

T2 - Workshop on Hybrid Metaheuristics, ECAI 2004

Y2 - 22 August 2004 through 23 August 2004

ER -