The shortest path problem on stochastic graphs is addressed. A stochastic optimal control problem is stated, for which dynamic programming can be used. The complexity of the problem leads us to look for a suboptimal solution making use of neural networks to approximate the cost-to-go function. ...
[3] SHORTEST PATH PROBLEMS WITH RESOURCE CONSTRAINTS, Stefan Irnich Guy Desaulniers [4] An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to Some Vehicle Routing Problems, Dominique Feillet, Pierre Dejax, Michel Gendreau, Cyrille Gueguen [5] An Exac...
Shortest path interdiction problem with arc improvement recourse: A multiobjective approachdynamic programminginterdictionmixed-integer programmingmultiobjective optimizationWe consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader ...
In this paper, the shortest path problem with forbidden paths is addressed. The problem under consideration is formulated as a particular instance of the resource-constrained shortest path problem. Different versions of a dynamic programming-based solution approach are defined and implemented. The propos...
In this paper we consider deterministic and stochastic shortest path problems with an infinite, possibly uncountable, number of states. The objective is to reach or approach a special destination state through a minimum cost path. We use an optimal control problem formulation, under assumptions that...
Shortest path problemIn graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.The problem of finding the shortest path between two intersections on a road map...
Constrained Shortest PathDynamic programmingNetwork optimizationSeveral variants of the classical Constrained Shortest Path Problem have been presented in the literature so far. One of the most recent is the k-Color Shortest Path Problem ( \\(k\\) -CSPP), that arises in the field of transmission...
The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are constrained within specified time windows.关键词: Dynamic programming Routing and scheduling k-shortest path DOI: doi:10.1016/j.orl.2008.07.003 被引量: 37 ...
展开 关键词: Theoretical or Mathematical/ dynamic programming graph theory/ graph theory dynamic programming shortest path problem network extreme nondominated paths complexity optimal path branch and bound method/ C1160 Combinatorial mathematics C1180 Optimisation techniques DOI...
From Shortest Paths to Reinforcement Learning: A MATLAB-Based Tutorial on Dynamic Programming 作者: Paolo Brandimarte 出版社: Springer定价: EUR 64.99ISBN: 9783030618667豆瓣评分 目前无人评价 评价: 写笔记 写书评 加入购书单 分享到 推荐 内容简介 ··· Covers both, classical numerical analysis approache...