Finding the K mean-standard deviation shortest paths under travel time uncertainty

DOI10.1007/S11067-024-09618-2MaRDI QIDQ6569063FDOQ6569063

Authors Maocan Song, Lin Cheng, Huimin Ge, Chao Sun 

Publication date 8 July 2024

Published in Networks and Spatial Economics (Search for Journal in Brave)

zbMATH Keywords

deviation pathtravel time uncertaintyK shortest path problemmean-standard deviation objectsolution space decomposition

Mathematics Subject Classification ID

Operations research and management science (90Bxx) Graph theory (05Cxx) Mathematical programming (90Cxx)

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• A Class of Label-Correcting Methods for the K Shortest Paths Problem
• A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
• Determining the \(K\)-best solutions of knapsack problems
• Finding shortest and dissimilar paths
• Finding \(K\) shortest looping paths with waiting time in a time--window network
• Finding reliable shortest paths in road networks under uncertainty
• Finding the k shortest simple paths
• Finding the K Shortest Loopless Paths in a Network
• Finding the \(K\) shortest paths in a schedule-based transit network
• Finding the first \(K\) shortest paths in a time-window network.
• Finding the k Shortest Paths
• Network flows. Theory, algorithms, and applications.
• On a routing problem
• On algorithms for finding the k shortest paths in a network
• Solving the \(k\)-best traveling salesman problem
• Solving the \(k\)-shortest path problem with time windows in a time varying network
• The Variance-Constrained Shortest Path Problem
• k-optimal solution sets for some polynomially solvable scheduling problems

This page was built for publication: Finding the K mean-standard deviation shortest paths under travel time uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569063)