An aggregate label setting policy for the multi-objective shortest path problem

DOI10.1016/J.EJOR.2010.06.035MaRDI QIDQ613476zbMATH OpenOpenAlexFDO

Authors Manuel Iori, Silvano Martello, D. Pretolani

Publication date 20 December 2010

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2010.06.035

zbMATH Keywords

shortest pathmulti-objectivelabel setting

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An improved multiobjective shortest path algorithm
• A multi-objective shortest path problem
• Multiobjective shortest path problems with lexicographic goal-based preferences
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
• Speeding up Martins' algorithm for multiple objective shortest path problems

Cites work

• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 3478624 (Why is no real title available?)
• scientific article; zbMATH DE number 1783874 (Why is no real title available?)
• A comparison of solution strategies for biobjective shortest path problems
• A multicriteria Pareto-optimal path algorithm
• Label correcting methods to solve multicriteria shortest path problems
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
• Multi-objective vehicle routing problems
• New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
• On a multicriteria shortest path problem
• On a special class of bicriterion path problems
• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
• The tricriterion shortest path problem with at least two bottleneck objective functions

Cited in

(11)

• An exact method for the biobjective shortest path problem for large-scale road networks
• Complexity of strict robust integer minimum cost flow problems: an overview and further results
• Non-additive shortest path in the context of traffic assignment
• Multiobjective shortest path problems with lexicographic goal-based preferences
• A comparison of heuristic best-first algorithms for bicriterion shortest path problems
• A personalized urban multicriteria shortest path stochastic optimization algorithm
• Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
• Lower bound sets for biobjective shortest path problems
• Dimensionality reduction in multiobjective shortest path search
• A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
• Bicriteria path problem minimizing the cost and minimizing the number of labels

This page was built for publication: An aggregate label setting policy for the multi-objective shortest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613476)