Heuristics for Fast One-to-Many Multicriteria Shortest Path Search

Kurbanov, Temirlan; Cuchý, Marek; Vokřínek, Jiří

doi:10.1109/itsc55140.2022.9922586

Cited by 2 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multi-criteria path selection or finding is important in many areas, e.g., transportation and communications. In transportation area, Kurbanov et al [8] proposed a one to many version of Pareto path set finding method, which is similar to our considered multi targets scenario. However, the criteria used are different, and the path computation in their work is based on the multicriteria label-setting algorithm, which can only deal with additive-type criteria.…”

Section: Related Workmentioning

confidence: 94%

Multi-Criteria Path Finding Using Multi-Queues Based Bidirectional Search for Multiple Target Nodes in Networks

Xu,

Liu,

Qian

et al. 2023

IEEE Access

View full text Add to dashboard Cite

The convergence of networking and cloud computing leads to an increasing number of cloud based services and applications, which require to be processed by network nodes with enough resources. There are multiple available nodes in the network and network operators need to find paths to forward the traffic to these nodes for processing. In addition, services and application may have diversified requirements on the paths in terms of bandwidth, delay, jitter, etc. Therefore, network operators need to determine the optimal paths considering multiple criteria. However, single-criterion based shortest path algorithms are often used to compute paths from a source node to one target node, which may result in uneven traffic distribution and low resource utilization. Furthermore, the paths obtained are only optimal to this criterion and may not satisfy the Service Level Agreement (SLA) requirements. Therefore, in this paper, we propose a multi-criteria path finding method to obtain all the Pareto-optimal paths from a source node to multiple target nodes (destinations). We extend an existing effective multi-criteria routing algorithm (ParetoBFS), and integrate a multi-queues based bidirectional search mechanism. Additionally, we use a topology sampling technique to accelerate path computation. We evaluate the performance of these path finding methods using various topologies with multiple criteria including bottleneck and additive types. Experimental results demonstrate that our approach can reduce the running time by 54% -89% in different topologies compared to the ParetoBFS algorithm. By employing topology sampling, we further improve our algorithm's speed while still finding most of the Pareto-optimal paths.INDEX TERMS bidirectional search, multi-criteria, path finding, path selection, routing.

show abstract

Section: Related Workmentioning

confidence: 94%

Multi-Criteria Path Finding Using Multi-Queues Based Bidirectional Search for Multiple Target Nodes in Networks

Xu,

Liu,

Qian

et al. 2023

IEEE Access

View full text Add to dashboard Cite

show abstract

“…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

Heuristics for Fast One-to-Many Multicriteria Shortest Path Search

Cited by 2 publications

References 13 publications

Multi-Criteria Path Finding Using Multi-Queues Based Bidirectional Search for Multiple Target Nodes in Networks

Multi-Criteria Path Finding Using Multi-Queues Based Bidirectional Search for Multiple Target Nodes in Networks

Exact Multi-objective Path Finding with Negative Weights

Contact Info

Product

Resources

About