Constrained shortest path problem in stochastic traffic network based on reliability

DOI10.3969/J.ISSN.1001-0505.2017.06.028MaRDI QIDQ3175649zbMATH OpenFDO

Authors Yiyong Pan, Jianxiao Ma

Publication date 18 July 2018

zbMATH Keywords

reliabilitybranch-and-boundstochastic networkoptimal pathresource constraintintelligent transportation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Mixed integer programming (90C11) Stochastic network models in operations research (90B15) Traffic problems in operations research (90B20)

Recommendations

• The Variance-Constrained Shortest Path Problem
• Lagrangian relaxation for the multiple constrained robust shortest path problem
• The constrained shortest path problem with stochastic correlated link travel times
• Probabilistic shortest path problems with budgetary constraints
• An algorithm for the resource constrained shortest path problem

Cited in

(3)

• An evaluation method for travel time reliability of road network with stochastic demand
• The Variance-Constrained Shortest Path Problem
• Lagrangian relaxation for the multiple constrained robust shortest path problem

This page was built for publication: Constrained shortest path problem in stochastic traffic network based on reliability

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