Title of article :
Multi-objectiveandmulti-constrainednon-additiveshortestpathproblems
Author/Authors :
Line BlanderReinhardt ، نويسنده , , DavidPisinger، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2011
Abstract :
Shortestpathproblemsappearassubproblemsinnumerousoptimizationproblems.Inmostpapers
concerningmultipleobjectiveshortestpathproblems,additivityoftheobjectiveisade-facto
assumption,butinmanyreal-lifesituationsobjectivesandcriteria,canbenon-additive.Thepurpose
of thispaperistogiveageneralframeworkfordominancetestsforproblemsinvolvinganumberof
non-additivecriteria.Thesedominancetestscanhelptoeliminatepathsinadynamicprogramming
frameworkwhenusingmultipleobjectives.Resultsonreal-lifemulti-objectiveproblemscontaining
non-additivecriteriaarereported.Weshowthatinmanycasestheframeworkcanbeusedtoefficiently
reducethenumberofgeneratedpaths.
Keywords :
Shortest path problem , Non-additive objective , Dynamic programming , Multi objective programming
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
