Results 21 to 30 of about 22,360 (263)
Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times [PDF]
مدیریت مهندسی و رایانش نرم, 2020 Network flow problems are considered a vital branch of operations research. These problems are classified into static and time-varying classes. Network flow problems are time-varying in real application, because any flow must take a given amount of time ...
Gholamhasan Shirdel, Hasan Rezapour
doaj +1 more source
ON ASSOCIATIVE SHORTEST PATH PROBLEMS [PDF]
Bulletin of informatics and cybernetics, 1997 Summary: We consider a wide class of shortest path problems in acyclic digraphs. In the problems, the length of a path is defined by using an associative binary operation. We derive recursive equations in dynamic programming for the problems, which involve additive, multiplicative, multiplicative-additive, minimum and fractional shortest path problems.
openaire +2 more sources
The Capacity Expansion Path Problem in Networks
Journal of Applied Mathematics, 2013 This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial
Jianping Li, Juanping Zhu
doaj +1 more source
Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph [PDF]
Neutrosophic Sets and Systems, 2019 One of the important non-linear data structures in Computer Science is graph. Most of the real life network, be it a road transportation network, or airlines network or a communication network etc., cannot be exactly transformed into a graph model, but ...
Siddhartha Sankar Biswas
doaj +1 more source
“rsppfp”: An R package for the shortest path problem with forbidden paths
SoftwareX, 2019 The Shortest Path Problem with Forbidden Paths (SPPFP) is a variant of the original shortest path problem, where the constraints come from a set of forbidden arc sequences that cannot be part of any feasible solution.
Melina Vidoni, Aldo Vecchietti
doaj +1 more source
An Algorithm for the Cycled Shortest Path Problem [PDF]
Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, 2011 For a network with cycle, where at least one cycle exists, the Floyd- Warshall algorithm is probably the most used algorithm to determine he least cost path between every pair of nodes on this network, i.e. the solution for the shortest path problem with
Asghar Aini, Amir Salehipour
doaj
International Journal of Analysis and Applications, 2023 The Shortest Path Problem is a core problem in network optimization, with applications in various scientific and engineering fields, such as communication, transportation, routing, scheduling, and computer networks.
K. Vidhya, A. Saraswathi
doaj +1 more source
A Hybrid Routing Approach Using Two Searching Layers
Electrical, Control and Communication Engineering, 2021 This paper considers SUB_GOALs by using basic A* algorithm and Subgoal Graphs in a hybrid approach to execute optimal route. SUB_GOALs identified with pre-searching from basic A* at break points and Subgoal Graphs at corners of obstacles are added to ...
Koca Gonca Ozmen, Yetkin Seda
doaj +1 more source
Dynamic Shortest Paths Methods for the Time-Dependent TSP
Algorithms, 2021 The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered.
Christoph Hansknecht +2 more
doaj +1 more source
The Rough Interval Shortest Path Problem
, 2021 The shortest path problem is one of the most popular network optimization problems and it is of great importance in areas such as transportation, network design or telecommunications. This model deals with determining a minimum weighted path between a pair of nodes of a given network.
Moghanni A., Pascoal M.
openaire +3 more sources