Results 301 to 310 of about 779,089 (370)

Planning-while-acting: addressing the continuous dynamics of planning and action in a virtually embodied task

Nuzzi D, Cisek P, Pezzulo G.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The constrained shortest path tour problem

Computers & Operations Research, 2016
In this paper, we study the constrained shortest path tour problem. Given a directed graph with non-negative arc lengths, the aim is to find a single-origin single-destination shortest path, which needs to cross a sequence of node subsets that are given in a fixed order. The subsets are disjoint and may be of different size. In addition, it is required
Ferone D, Festa P, Guerriero F, Laganà D   +3 more
openaire   +4 more sources

A Different Approach for Solving the Shortest Path Problem Under Mixed Fuzzy Environment

International Journal of Fuzzy System Applications, 2020
The authors present a new algorithm for solving the shortest path problem (SPP) in a mixed fuzzy environment. With this algorithm, the authors can solve the problems with different sets of fuzzy numbers e.g., normal, trapezoidal, triangular, and LR-flat ...
Ranjan Kumar, S. Jha, Ramayan Singh
semanticscholar   +1 more source

A Study of Neutrosophic Shortest Path Problem

, 2020
Shortest path problem (SPP) is an important and well-known combinatorial optimization problem in graph theory. Uncertainty exists almost in every real-life application of SPP.
Ranjan Kumar, Arindam Dey, S. Broumi, F. Smarandache   +3 more
semanticscholar   +1 more source

Resolving the shortest path problem using the haversine algorithm

, 2020
Route search requires a useful and accurate algorithm to calculate the distance between two objects, especially on a round surface such as the earth. This algorithm provides a considerable circle distance between two locations on a non-flat surface.
D. A. Prasetya, P. Nguyen, R. Faizullin, I. Iswanto, E. F. Armay   +4 more
semanticscholar   +1 more source

Solving the shortest path tour problem [PDF]

European Journal of Operational Research, 2013
In this paper, we study the shortest path tour problem in which a shortest path from a given origin node to a given destination node must be found in a directed graph with non-negative arc lengths. Such path needs to cross a sequence of node subsets that are given in a fixed order. The subsets are disjoint and may be different-sized.
Festa P, Guerriero F, Laganà D, Musmanno R   +3 more
openaire   +3 more sources

The shortest path problem with forbidden paths

European Journal of Operational Research, 2005
We consider a variant of the constrained shortest path problem, where the constraints come from a set of forbidden paths (arc sequences) that cannot be part of any feasible solution. Two solution approaches are proposed for this variant. The first uses Aho and Corasick's keyword matching algorithm to filter paths produced by a k-shortest paths ...
Guy Desaulniers, Daniel Villeneuve
openaire   +3 more sources

Shortest Path Problems

2000
Consider a digraph G = (V, E) with non- negative costs c(e) = c ij (∀ e = (i, j) ∈ E) associated with the edges in G. To simplify further notation we define c ij := ∞ for all (i, j) ∉ E.
Kathrin Klamroth, Horst W. Hamacher
openaire   +4 more sources

On the Shortest Path Problems with Edge Constraints

2020 22nd International Conference on Transparent Optical Networks (ICTON), 2020
The goal of this work is to provide a brief classification of some Shortest Path Problem (SPP) variants that include edge constraints and that find applications in several different contexts, including optical networks, transportation and logistics.
Ferone D., Festa P., Fugaro S., Pastore T.   +3 more
openaire   +3 more sources