Enhanced Methods for the Weight Constrained Shortest Path Problem: Constrained Path Finding Meets Bi-objective Search

07/29/2022
by   Saman Ahmadi, et al.
0

The classic problem of constrained path finding is a well-studied but yet challenging topic in AI with a broad range of applications in various areas such communication and transportation. The Weight Constrained Shortest Path Problem (WCSPP), as the base form of constrained path finding with only one side constraint, aims to plan a cost optimum path whose weight/resource usage is limited. Given the bi-criteria nature of the problem (i.e., dealing with cost and weight of paths), methods addressing the WCSPP have some common properties with bi-objective search. This paper leverages the recent state-of-the-art A*-based techniques in both constrained path finding and bi-objective search and presents two exact solution approaches to the WCSPP, both capable of solving hard problem instances on very large graphs. We empirically evaluate the performance of our algorithms on a new set of large and realistic problem instances and show their advantages over the state-of-the-art algorithms in both time and space metrics. This paper also investigates the importance of priority queues in constrained search with A*. We show with extensive experiments on both realistic and randomised graphs how bucket-based queues without tie-breaking can effectively improve the algorithmic performance of exhaustive bi-criteria searches.

READ FULL TEXT
research
06/18/2020

Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier

We consider the bi-criteria shortest-path problem where we want to compu...
research
07/19/2023

Labeling Methods for Partially Ordered Paths

The landscape of applications and subroutines relying on shortest path c...
research
08/15/2023

Tightest Admissible Shortest Path

The shortest path problem in graphs is fundamental to AI. Nearly all var...
research
08/22/2022

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates

The shortest path problem in graphs is a cornerstone for both theory and...
research
06/14/2023

PathWise: a flexible, open-source library for the Resource Constrained Shortest Path

In this paper, we consider a fundamental and hard combinatorial problem:...
research
08/09/2018

A Constrained Shortest Path Scheme for Virtual Network Service Management

Virtual network services that span multiple data centers are important t...
research
02/12/2021

A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization

The Clustered Shortest-Path Tree Problem (CluSPT) plays an important rol...

Please sign up or login with your details

Forgot password? Click here to reset