Title of article :
Exact andheuristicalgorithmsfortheintervaldatarobustassignmentproblem
Author/Authors :
Jordi Pereira، نويسنده , , IgorAverbakh، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
We considertheAssignmentProblemwithintervaldata,whereitisassumedthatonlyupperandlower
boundsareknownforeachcostcoefficient.Itisrequiredtofindaminmaxregretassignment.Theproblem
is knowntobestronglyNP-hard.Wepresentandcomparecomputationallyseveralexactandheuristic
methods,includingBendersdecomposition,usingCPLEX,avariabledepthneighborhoodlocalsearch,and
two hybridpopulation-basedheuristics.Wereportresultsofextensivecomputationalexperiments.
Keywords :
Benders decomposition , Hybrid heuristic , Genetic Algorithm , Interval data , Assignment problem , Minmax regret optimization
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
