New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems

DOI10.1080/00207160412331296715zbMath1079.90146OpenAlexW2160056724MaRDI QIDQ4653708

T. N. Janakiraman, S. Ismail Mohideen, V. Narsimha Sastry

Publication date: 7 March 2005

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160412331296715

zbMATH Keywords

Networks, Multiple objectives, Pareto minimum paths, \(k\)-Shortest paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks, An aggregate label setting policy for the multi-objective shortest path problem, The tricriterion shortest path problem with at least two bottleneck objective functions, Pareto optimal mapping for tile-based network-on-chip under reliability constraints

Cites Work

• Shortest paths in networks with vector weights
• Modified algorithm to compute Pareto-optimal vectors
• Shortest Path Algorithms: An Evaluation Using Real Road Networks
• On algorithms for finding the k shortest paths in a network
• Shortest-path algorithms: Taxonomy and annotation