Title of article :
GRASP andpathrelinkingforthemax–mindiversityproblem
Author/Authors :
M.G.C. Resende، نويسنده , , R.Mart?b، نويسنده , , M.Gallegoc، نويسنده , , A.Duartec، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
The max–mindiversityproblem(MMDP)consistsinselectingasubsetofelementsfromagivenset
in suchawaythatthediversityamongtheselectedelementsismaximized.TheproblemisNP-hard
and canbeformulatedasanintegerlinearprogram.Sincethe1980s,severalsolutionmethodsforthis
problem havebeendevelopedandappliedtoavarietyoffields,particularlyinthesocialandbiological
sciences. Weproposeaheuristicmethod—basedontheGRASPandpathrelinkingmethodologies—for
finding approximatesolutionstothisoptimizationproblem.Weexploredifferentwaystohybridize
GRASP andpathrelinking,includingtherecentlyproposedvariantknownasGRASPwithevolutionary
path relinking.Empiricalresultsindicatethattheproposedhybridimplementationscomparefavorablyto
previous metaheuristics,suchastabusearchandsimulatedannealing.
Keywords :
GRASP , Path relinking , Max–min diversity problem , Metaheuristics , Adaptive memory programming
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
