scholarly journals A distribution strategy using a two-step optimization to maximize blood services considering stochastic travel times

Author(s):  
Filscha Nurprihatin ◽  
Refael Elnathan ◽  
Ruth Elisa Rumawan ◽  
Tasya Regina
2014 ◽  
Vol 587-589 ◽  
pp. 1854-1857
Author(s):  
Yi Yong Pan

This paper addresses adaptive reliable shortest path problem which aims to find adaptive en-route guidance to maximize the reliability of arriving on time in stochastic networks. Such routing policy helps travelers better plan their trips to prepare for the risk of running late in the face of stochastic travel times. In order to reflect the stochastic characteristic of travel times, a traffic network is modeled as a discrete stochastic network. Adaptive reliable shortest path problem is uniformly defined in a stochastic network. Bellman’s Principle that is the core of dynamic programming is showed to be valid if the adaptive reliable shortest path is defined by optimal-reliable routing policy. A successive approximations algorithm is developed to solve adaptive reliable shortest path problem. Numerical results show that the proposed algorithm is valid using typical transportation networks.


Author(s):  
Alejandro Estrada-Moreno ◽  
Marta Cavero-Lazaro ◽  
Angel A. Juan ◽  
Carles Serrat ◽  
Maria Nogal

Sign in / Sign up

Export Citation Format

Share Document