A new model for path planning with interval data

DOI10.1016/j.cor.2008.06.002zbMath1179.90319OpenAlexW2071901388MaRDI QIDQ1000974

Jie Hu, Xiao-Dong Hu, Xu-jin Chen

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.06.002

zbMATH Keywords

path planninginterval dataminimum risk-sum

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Dynamic shortest path problems: hybrid routing policies considering network disruptions ⋮ Min‐sum controllable risk problems with concave risk functions of the same value range ⋮ Deterministic risk control for cost-effective network connections ⋮ Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients ⋮ Min-max controllable risk problems ⋮ Exact approaches for solving robust prize-collecting Steiner tree problems

Cites Work

• The computational complexity of the relative robust shortest path problem with interval data
• The shortest path problem with two objective functions
• Robust discrete optimization and its applications
• On the robust shortest path problem.
• A branch and bound algorithm for the robust shortest path problem with interval data.
• Arriving on time
• The shortest route problem with constraints
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Approximation Schemes for the Restricted Shortest Path Problem
• Bicriteria Network Design Problems
• On the online shortest path problem with limited arc cost dependencies
• Shortest Paths in Probabilistic Graphs

This page was built for publication: A new model for path planning with interval data