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

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

doi:10.1080/00207160412331296715

Cited by 14 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that one-toall MOSP exhibits a larger search space than the point-topoint variant, demanding far larger computation time. The path-ranking method of Sastry, Janakiraman, and Mohideen (2005) and the label setting approach of Kurbanov, Cuchý, and Vokrínek (2022) are two other MOSP approaches that can deal with negative weights. These solutions are not exact, as they do not compute all Pareto-optimal solutions.…”

Section: Mosp With Negative Weights and Negative Cyclesmentioning

confidence: 99%

Exact Multi-objective Path Finding with Negative Weights

Ahmadi,

Sturtevant,

Harabor

et al. 2024

ICAPS

View full text Add to dashboard Cite

The point-to-point Multi-objective Shortest Path (MOSP) problem is a classic yet challenging task that involves finding all Pareto-optimal paths between two points in a graph with multiple edge costs. Recent studies have shown that employing A* search can lead to state-of-the-art performance in solving MOSP instances with non-negative costs. This paper proposes a novel A*-based multi-objective search framework that not only handles graphs with negative costs and even negative cycles but also incorporates multiple speed-up techniques to enhance the efficiency of exhaustive search with A*. Through extensive experiments, our algorithm demonstrates remarkable success in solving difficult MOSP instances, outperforming leading solutions by several factors.

show abstract

Section: Mosp With Negative Weights and Negative Cyclesmentioning

confidence: 99%

Exact Multi-objective Path Finding with Negative Weights

Ahmadi,

Sturtevant,

Harabor

et al. 2024

ICAPS

View full text Add to dashboard Cite

show abstract

“…Significant resources and computing time are needed for generating the Pareto-optimal solutions for a complex MOSPP network. Sastry et al (28) presented a polynomial time algorithm for finding the Pareto-optimal paths in an MOSPP. This involved finding the arithmetic mean of the multiple arc costs and using them to convert the MOSPP problem into a single-objective shortest path problem.…”

Section: Multiobjective Trade-off Analysismentioning

confidence: 99%

Risk Analysis of Safety Service Patrol (SSP) Systems in Virginia

Dickey

Santos²

2011

Risk Analysis

View full text Add to dashboard Cite

The transportation infrastructure is a vital backbone of any regional economy as it supports workforce mobility, tourism, and a host of socioeconomic activities. In this article, we specifically examine the incident management function of the transportation infrastructure. In many metropolitan regions, incident management is handled primarily by safety service patrols (SSPs), which monitor and resolve roadway incidents. In Virginia, SSP allocation across highway networks is based typically on average vehicle speeds and incident volumes. This article implements a probabilistic network model that partitions "business as usual" traffic flow with extreme-event scenarios. Results of simulated network scenarios reveal that flexible SSP configurations can improve incident resolution times relative to predetermined SSP assignments.

show abstract

“…size distribution of human settlements, frequency of human relations [14,20]), scale-free networks (Epidemic spreading and transportation dynamics [9,15]), transportation networks (e.g. search of the Pareto minimum paths [21]), natural phenomena (e.g. Gutenberg-Richter law of earthquake magnitudes [10]), biocomputation (e.g.…”

Section: Three Clusters Of Usersmentioning

confidence: 99%

Modelling user's activity in a real-world complex network

Pellicer-Lostao

Morató

López‐Ruiz

2008

International Journal of Computer Mathematics

View full text Add to dashboard Cite

In this paper, a new statistical user model for the Internet access is presented. Real traces of Internet traffic in a heterogeneous campus network are analysed. We find three clearly different styles of individual user's behaviour, study their common features and group particular users behaving alike in three clusters. This allows us to build a probabilistic mixture model that implements the expected global behaviour for the different types of users. The implications of this emergent phenomenology are discussed in the field of multi-agent complex systems.

show abstract

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

Cited by 14 publications

References 7 publications

Exact Multi-objective Path Finding with Negative Weights

Exact Multi-objective Path Finding with Negative Weights

Risk Analysis of Safety Service Patrol (SSP) Systems in Virginia

Modelling user's activity in a real-world complex network

Contact Info

Product

Resources

About