Title of article :
Minimum costpathproblemswithrelays
Author/Authors :
Gilbert Laporte، نويسنده , , MartaM.B.Pascoal ، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
The minimumcostpathproblemwithrelays (MCPPR)consistsoffindingaminimumcostpathfroma
sourcetoadestination,alongwhichrelaynodesarelocatedatacertaincost,subjecttoaweight
constraint.ThispaperfirstmodelstheMCPPRasaparticularbicriteriapathprobleminvolvingan
aggregatedfunctionofthepathandrelaycosts,aswellasaweightfunction.Avariantofthisproblem
which takesintoaccountallthreefunctionsseparatelyisthenconsidered.FormulatingtheMCPPRasa
part ofabicriteriapathproblemallowsthedevelopmentoflabelingalgorithmsinwhichtheboundon
the weightofpathscontrolsthenumberofnodelabels.Thealgorithmforthisconstrainedsingle
objectivefunctionversionoftheproblemhasatimecomplexityof OðWmþWnlogðmaxfW,ngÞÞ, where n
is thenumberofnodes, m is thenumberofarcsand W is theweightupperbound.Computational
results onrandominstanceswithupto10000nodesand100000arcs,arereported.
Keywords :
Bicriteria optimization , Labeling algorithms , Relays , Shortest path problem
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
