Stochastic shortest path problem with uncertain delays

Jianqiang Cheng, Stefanie Kosuch, Abdel Lisser

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

This paper considers a stochastic version of the shortest path problem, the Stochastic Shortest Path Problem with Delay Excess Penalty on directed, acyclic graphs. In this model, the arc costs are deterministic, while each arc has a random delay, assumed normally distributed. A penalty occurs when the given delay constraint is not satisfied. The objective is to minimize the sum of the path cost and the expected path delay penalty. In order to solve the model, a Stochastic Projected Gradient method within a branch-and-bound framework is proposed and numerical examples are given to illustrate its effectiveness. We also show that, within given assumptions, the Stochastic Shortest Path Problem with Delay Excess Penalty can be reduced to the classic shortest path problem.

Original languageEnglish (US)
Title of host publicationICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems
Pages256-264
Number of pages9
StatePublished - 2012
Externally publishedYes
Event1st International Conference on Operations Research and Enterprise Systems, ICORES 2012 - Vilamoura, Algarve, Portugal
Duration: Feb 4 2012Feb 6 2012

Publication series

NameICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems

Conference

Conference1st International Conference on Operations Research and Enterprise Systems, ICORES 2012
Country/TerritoryPortugal
CityVilamoura, Algarve
Period2/4/122/6/12

Keywords

  • Active set methods
  • Branch-and-bound
  • Projected gradient algorithm
  • Shortest path
  • Stochastic programming

ASJC Scopus subject areas

  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'Stochastic shortest path problem with uncertain delays'. Together they form a unique fingerprint.

Cite this