We consider both discrete and continuous control problems constrained by a fixed budget of some resource, which may be renewed upon entering a preferred subset of the state space. In the discrete case, we consider deterministic shortest path problems on graphs with a full budget reset in all preferred nodes. In the continuous case, we derive augmented PDEs of optimal control, which are then sol...

We consider both discrete and continuous control problems constrained by a fixed budget of some resource, which may be renewed upon entering a preferred subset of the state space. In the discrete case, we consider both deterministic and stochastic shortest path problems with full budget resets in all preferred nodes. In the continuous case, we derive augmented PDEs of optimal control, which are...

the dogleg severity is one of the most important parameters in directional drilling. improvement of these indicators actually means choosing the best conditions for the directional drilling in order to reach the target point. selection of high levels of the dogleg severity actually means minimizing well trajectory, but on the other hand, increases fatigue in drill string, increases torque and d...

The shortest path problem in which the (s, t)-paths P of a given digraph G = (V,E) are compared with respect to the sum of their edge costs is one of the best known problems in combinatorial optimization. The paper is concerned with a number of variations of this problem having different objective functions like bottleneck, balanced, minimum deviation, algebraic sum, k-sum and k-max objectives,...

The paper proposes an improved vectorial labelling routing algorithm for ATM networks. It is known that the shortest path problem with one or more constraints is NP-complete. The proposed algorithm can find an approximate optimal path subject to multiple constraints with arbitrary accuracy in polynomial time-scale. The numerical results show that the algorithmic loops are reduced to about 1/3 o...

a shortest path problem is a practical issue in networks for real-world situations. this paper addresses the fuzzy shortest path (fsp) problem to obtain the best fuzzy path among fuzzy paths sets. for this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (ifss) in order to determine the fuzzy shortest path. moreover, this algorithm is developed for ...