For finding a shortest path in a network the bidirectional~A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes. %This algorithm distinguishes between the main phase and the postprocessing phase. %As long as the search...

Приведен алгоритм поиска оптимального пути на графе с переменными весами. Рассмотрены формулы построения двумерных кубических сплайнов дефекта 1 и их вывод.

A widely known algorithm for ¯nding the shortest path in a network is Bidirectional A*. The version of bidirectional A* that is considered the most appropriate hitherto, uses so-called balanced heuristic estimates. In this paper, we focus on symmetric heuristic estimates. First, we show that...

For finding a shortest path in a network the bidirectional A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes. The version of bidirectional~A* that is considered the most appropriate in literature hitherto, uses...

For finding a shortest path in a network the bidirectional~A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes. %This algorithm distinguishes between the main phase and the postprocessing phase. %As long as the search...

The aim of this research is to identify the relationship between activity patterns and route choice decisions. The focus is twofold: on the one hand, the relationship between the purpose of a trip and the road categories used for the relocation is investigated; on the other hand, the relationship...

This paper describes a simulation procedure for estimating the distribution function of the shortest path length in a network with random arc lengths. The method extends the concept of conditional Monte Carlo utilizing special properties of the Uniformly Directed Cutsets and the unique arcs. The...

It is known that minimum cost flow problems can be solved by successive augmentations along shortest paths. In this paper the issues of implementing shortest path algorithms in this context are examined. Of particular interest is the dynamic topology that the flow networks exhibit. We develop a...