Dynamic shortest path in stochastic dynamic networks: Ship routing problem
From MaRDI portal
Publication:1869695
DOI10.1016/S0377-2217(01)00385-XzbMath1037.90053MaRDI QIDQ1869695
Publication date: 28 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)
Related Items
Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations, The dynamic shortest path problem with anticipation, Minimizing the fuel consumption and the risk in maritime transportation: a bi-objective weather routing approach, Heuristics for dynamic and stochastic routing in industrial shipping, A simulated annealing for multi-criteria network path problems, Time-dependent routing problems: a review, Bicriteria shortest path in networks of queues, The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks, A fully polynomial time approximation scheme for the probability maximizing shortest path problem, Uncertainty in maritime ship routing and scheduling: a literature review, Dynamic journeying under uncertainty, Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a multicriteria shortest path problem
- Generalized dynamic programming for multicriteria optimization
- Multiobjective routing of hazardous materials in stochastic networks
- Shortest-path algorithms: Taxonomy and annotation
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- An Analysis of Stochastic Shortest Path Problems
- Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
- Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
- Distribution of the Time Through a Directed, Acyclic Network
- Shortest Paths in Probabilistic Graphs
