Abstract
Abstract We study and solve a particular stochastic version of the Restricted Shortest Path Problem, the Stochastic Shortest Path Problem with Delay Excess Penalty. While arc costs are kept deterministic, arc delays are assumed to be normally distributed and a penalty per time unit occurs whenever the given delay constraint is not satisfied. The objective is to minimize the sum of path cost and total delay penalty.
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
