An Experimental Study on Exact Multi-constraint Shortest Path Finding

Zhang, Xuanyi; Liu, Ziyi; Zhang, Mengxuan; Li, Lei

doi:10.1007/978-3-030-69377-0_14

Cited by 6 publications

(4 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CSP is more applicable in real-life as it only returns one shortest path that satisfies constraints on other criteria. As it is a special case of the skyline path, it is still very timeconsuming to search directly [10], [27], [28], [48], [65], [88] for CSP. As CSP is known as NP-Hard [30], so approximate algorithms are more appealing [28], [30], [32], [47], [75].…”

Section: Constrained Shortest Path (Csp)mentioning

confidence: 99%

I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs

Zhou,

Huang,

et al. 2024

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

Shortest path computation is a basic operation for many graph-based applications and has been extensively studied. However, most existing works only consider the optimal path of a single criterion but ignore real-world situations involving multiple criteria. This paper investigates a new Multi-Criteria Shortest Paths (MCSPs) problem, aiming to compute the shortest paths of all criteria between a vertex pair. It is significant for real-world applications such as GPS navigation and social network analysis. Nevertheless, the rapid growth of graph size or memory-limited devices poses a memory-constraint challenge, making the adaptation of existing methods extremely time-consuming. To solve the memory-constraint MCSPs problem, we propose a general STOP & SHARE scheme to synchronize the search speeds of all criteria for sharing partition accesses. Two algorithms called OHP and MHP, adopting the one-hop strategy and partition exhaustive strategy, respectively, are proposed for implementing our scheme. Moreover, we develop two optimized algorithms, BMHP and BMHPS, to improve query efficiency by combining MHP with the bidirectional technique and a novel in-partition shortcut optimization. We also investigate partition-oriented I/O management. Experimental studies on large real-world graphs demonstrate the effectiveness of the proposed methods over the multi-pass adaptations of the existing methods.

show abstract

Section: Constrained Shortest Path (Csp)mentioning

confidence: 99%

I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs

Zhou,

Huang,

et al. 2024

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

“…Algorithms. We extend the following state-of-theart exact CSP algorithms to their MCSP versions [53]: Sky-Dij [14], cKSP [9], eKSP [39], CSP-CH [41], COLA [45] with α=1. We denote our methods as C2Hop and F2Hop.…”

Section: Experimental Settingsmentioning

confidence: 99%

“…[22,48] restricts the skyline path to the pre-defined "preference function", so they cannot be utilized to answer MCSP problem. [53] compares and conducts experiments on the skylinebased and k-shortest path-based methods.…”

Section: Multi-constraint Shortest Pathmentioning

confidence: 99%

Multi-Constraint Shortest Path using Forest Hop Labeling

Liu¹,

Li²,

Zhang³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

The Multi-Constraint Shortest Path (MCSP) problem aims to find the shortest path between two nodes in a network subject to a given constraint set. It is typically processed as a skyline path problem. However, the number of intermediate skyline paths becomes larger as the network size increases and the constraint number grows, which brings about the dramatical growth of computational cost and further makes the existing index-based methods hardly capable of obtaining the complete exact results. In this paper, we propose a novel high-dimensional skyline path concatenation method to avoid the expensive skyline path search, which then supports the efficient construction of hop labeling index for MCSP queries. Specifically, a set of insightful observations and techniques are proposed to improve the efficiency of concatenating two skyline path set, a n-Cube technique is designed to prune the concatenation space among multiple hops, and a constraint pruning method is used to avoid the unnecessary computation. Furthermore, to scale up to larger networks, we propose a novel forest hop labeling which enables the parallel label construction from different network partitions. Our approach is the first method that can achieve both accuracy and efficiency for MCSP query answering. Extensive experiments on real-life road networks demonstrate

show abstract

“…A large number of constraints must be considered to ensure that every constraint is accounted. An expeditious choice based on the route's effectiveness should be used [29][30][31][32][33]. Given the advances in recent genetic routing, pathfinding algorithms are currently most often used to identify a feasible path.…”

Section: Introductionmentioning

confidence: 99%

Improving Waste Management System Efficiency and Mobility with Efficient Path MANET

et al. 2021

View full text Add to dashboard Cite

Waste Management System (WMS) is applied in smart cities and is supported by the Internet of Things (IoT). WMS involves several responsibilities, such as collection, disposal, and utilization of waste in relevant facilities. Efficient waste management has a considerable impact on the quality of life of citizens in smart cities. The interaction between wireless sensor networks and mobile ad-hoc networks (MANETs) with IoT provides excellent mobility for users, and reduces the deployment costs of networks. Data transfer via the intermediate connected devices must be maintained to shorten the distance between the devices. Intelligent routing algorithm is proposed to find efficient paths that comply with the WMS requirement constraints and avoid invalid paths that cause increased computation time. Chromosome intersection operation on genetic-based routing algorithm, intersection activation function, and intersection node table are proposed to avoid the similarity and redundancy of generated paths and keep the validity of the paths. This study improves the path finding, obtains good results, and increases the rate of efficient paths. Results show that the selected path is efficient in terms of distance, number of hops and number of iterations by using the proposed method. In addition, this proposed method outperforms DSR, which offers alternative paths with more efficiency.

show abstract

An Experimental Study on Exact Multi-constraint Shortest Path Finding

Cited by 6 publications

References 31 publications

I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs

I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs

Multi-Constraint Shortest Path using Forest Hop Labeling

Improving Waste Management System Efficiency and Mobility with Efficient Path MANET

Contact Info

Product

Resources

About