A fully polynomial time approximation scheme for the probability maximizing shortest path problem

•Algorithms for the probability maximizing shortest path problem are proposed.•Pseudo polynomially or polynomially solvable special cases are identified.•A novel fully polynomial time approximation scheme (is proposed). In this paper, we consider a probability maximizing shortest path problem. For a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 300; číslo 1; s. 35 - 45
Hlavní autoři: Lee, Jisun, Joung, Seulgi, Lee, Kyungsik
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.07.2022
Témata:
Combinatorial optimization
Exact algorithm
Fully polynomial time approximation scheme
Probability maximization
Shortest path
Shortest path
Fully polynomial time approximation scheme
Combinatorial optimization
Exact algorithm
Probability maximization
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Algorithms for the probability maximizing shortest path problem are proposed.•Pseudo polynomially or polynomially solvable special cases are identified.•A novel fully polynomial time approximation scheme (is proposed). In this paper, we consider a probability maximizing shortest path problem. For a given directed graph with the length of each arc being an independent normal random variable with rational mean and standard deviation, the problem is to find a simple s−t path that maximizes the probability of arriving at the destination within a given limit. We first prove that the problem is NP-hard even on directed acyclic graphs with the mean of the length of each arc being restricted to an integer. Then, we present pseudo-polynomial time exact algorithms for the problem along with nontrivial special cases that can be solved in polynomial time. Finally, we present a fully polynomial time approximation scheme (FPTAS) that iteratively solves deterministic shortest path problems. The structure of the proposed approximation scheme can be applied to devise FPTAS for other probability maximizing combinatorial optimization problems once the corresponding deterministic problems are polynomially solvable.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2021.10.018