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

DOI10.1016/J.EJOR.2010.06.035zbMATH Open1206.90161OpenAlexW2046441823MaRDI QIDQ613476FDOQ613476

Silvano Martello, Manuel Iori, 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

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

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)

Cites Work

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

Cited In (9)

• 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
• 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
• 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)