Title of article :
The network p-medianproblemwithdiscreteprobabilisticdemandweights
Author/Authors :
Oded Berman، نويسنده , , JiaminWang، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
Westudytheproblemoflocating p facilitiestoserveclientsresidingatthenodesofanetworkwith
discreteprobabilisticdemandweights.Theobjectiveistomaximizetheprobabilitythatthetotal
weighted distancefromaclienttotheclosestfacilitydoesnotexceedagiventhresholdvalue.The
problem isformulatedasanintegerprogrambutcanbesolvedonlyforverysmallinstancesbecauseof
the exponentialnumberofdecisionvariablesandconstraints.Weanalyzetheproblemand,usinga
normalapproximationofthetotalweighteddistancewedevelopbranchandboundsolutionprocedures
for variouscasesoftheproblem.Wealsodevelopheuristicsandmeta-heuristicstosolvetheproblem.
Basedonourcomputationalexperimentswemakerecommendationsonwhichapproachtouseand
when.
Keywords :
Hybrid flow shop
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
