Dynamic shortest path in stochastic dynamic networks: Ship routing problem

Amir Azaron; Farhad Kianfar

doi:10.1016/s0377-2217(01)00385-x

ScienceGate Book Chapters

JOURNAL ARTICLE

Dynamic shortest path in stochastic dynamic networks: Ship routing problem

Amir Azaron Farhad Kianfar

Year: 2002 Journal: European Journal of Operational Research Vol: 144 (1)Pages: 138-156 Publisher: Elsevier BV

DOI: 10.1016/s0377-2217(01)00385-x

Get Full-Text PDF Get Analytical Report

Keywords:

Shortest path problem Node (physics) Variable (mathematics) Random variable Mathematical optimization State variable Computer science Markov process Exponential function Sink (geography) Path (computing) Markov chain Exponential distribution Routing (electronic design automation) Mathematics Computer network Theoretical computer science Graph Engineering Statistics

Metrics

Cited By

1.16

FWCI (Field Weighted Citation Impact)

Refs

0.81

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Reliability and Maintenance Optimization

Physical Sciences → Engineering → Safety, Risk, Reliability and Quality

Dynamic shortest path in stochastic dynamic networks: Ship routing problem

Metrics

Citation History

Topics

Related Documents

Research on Dynamic Stochastic Shortest Path Problem

Vehicle Routing and Scheduling Incorporating Shortest Path Model for Dynamic and Stochastic Networks

Dynamic stochastic shortest path algorithm

Optimal Routing Problem in Dynamic Stochastic Networks

Dynamic Programming: Stochastic Shortest Path Problems