Filters








128,923 Hits in 3.8 sec

On Dynamic Shortest Paths Problems [chapter]

Liam Roditty, Uri Zwick
2004 Lecture Notes in Computer Science  
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths problems, for weighted  ...  directed or undirected graphs, are, in a strong sense, at least as hard as the static all-pairs shortest-paths problem.  ...  Fully Dynamic All-Pairs Shortest Paths In this section we obtain a new fully dynamic algorithm for the all-pairs shortest paths problem. The algorithm relies on ideas of [14] and [20] .  ... 
doi:10.1007/978-3-540-30140-0_52 fatcat:ekwwih5dcfe6hjfntk7r24mnou

On Dynamic Shortest Paths Problems

Liam Roditty, Uri Zwick
2010 Algorithmica  
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths problems, for weighted  ...  directed or undirected graphs, are, in a strong sense, at least as hard as the static all-pairs shortest-paths problem.  ...  Fully Dynamic All-Pairs Shortest Paths In this section we obtain a new fully dynamic algorithm for the all-pairs shortest paths problem. The algorithm relies on ideas of [14] and [20] .  ... 
doi:10.1007/s00453-010-9401-5 fatcat:2pf45vg5zrg4pmtlxp5ewidsua

On-line and dynamic algorithms for shortest path problems [chapter]

Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
1995 Lecture Notes in Computer Science  
We also describe the first parallel algorithms for solving the dynamic version of the shortest path problem.  ...  We describe algorithms for finding shortest paths and distances in a planar digraph which exploit the particular topology of the input graph.  ...  The dynamic version of the shortest paths problem has a lot of applications.  ... 
doi:10.1007/3-540-59042-0_73 fatcat:w2e47jlqwfbtpjybljtxfhhbhq

Runtime analysis of ant colony optimization on dynamic shortest path problems

Andrei Lissovoi, Carsten Witt
2015 Theoretical Computer Science  
A simple ACO algorithm called λ-MMAS for dynamic variants of the single-destination shortest paths problem is studied by rigorous runtime analyses.  ...  Finally, parameters of dynamic shortest-path problems which make the optimum difficult to track are discussed. Experiments illustrate theoretical findings and conjectures.  ...  A simple ACO algorithm based on the Max-Min Ant System (Stützle and Hoos, 2000) is studied on dynamic shortest path problems with increasing amount of dynamics.  ... 
doi:10.1016/j.tcs.2014.06.035 fatcat:ntb5lfgskjhbzbkolgxivuguhu

Runtime analysis of ant colony optimization on dynamic shortest path problems

Andrei Lissovoi, Carsten Witt
2013 Proceeding of the fifteenth annual conference on Genetic and evolutionary computation conference - GECCO '13  
A simple ACO algorithm called λ-MMAS for dynamic variants of the single-destination shortest paths problem is studied by rigorous runtime analyses.  ...  Finally, parameters of dynamic shortest-path problems which make the optimum difficult to track are discussed. Experiments illustrate theoretical findings and conjectures.  ...  A simple ACO algorithm based on the Max-Min Ant System (Stützle and Hoos, 2000) is studied on dynamic shortest path problems with increasing amount of dynamics.  ... 
doi:10.1145/2463372.2463567 dblp:conf/gecco/LissovoiW13 fatcat:b7h3nlpsovamhp4jxjsamsf55e

Memory-based multi-population genetic learning for dynamic shortest path problems

Yiya Diao, Changhe Li, Sanyou Zeng, Michalis Mavrovouniotis, Shengxiang Yang
2019 2019 IEEE Congress on Evolutionary Computation (CEC)  
The framework is instantiated for a 3D dynamic shortest path problem, which is developed in this paper.  ...  This paper proposes a general algorithm framework for solving dynamic sequence optimization problems (DSOPs).  ...  III. 3D DYNAMIC SHORTEST PATH PROBLEM A 3D DSPP is proposed in this section.  ... 
doi:10.1109/cec.2019.8790211 dblp:conf/cec/DiaoLZMY19 fatcat:rms6jnrwnnf3xcgwjtay6yutze

On the relationship between imitative logit dynamics in the population game theory and mirror descent method in the online optimization using the example of the Shortest Path Problem [article]

Alexander Gasnikov, Anastasia Lagunovskaya, Larisa Morozova
2016 arXiv   pre-print
We demonstrate the connection of this two type dynamics on the Shortest Path Problem.  ...  In this paper we describe how imitative logit dynamic (rather popular in population games theory) can be interpreted in terms of mirror descent method (well known in convex optimization).  ...  Введение В литературе по онлайн оптимизации почетное место занимает, так называемая, "Задача о выборе кратчайшего пути" ("The Shortest Path Problem"), см., например, п. 5.4 [1] .  ... 
arXiv:1511.02398v5 fatcat:emiwwmuo4vhmvn7t5br37bquea

Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks

Hui Cheng, Shengxiang Yang
2009 2009 IEEE Congress on Evolutionary Computation  
In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic algorithms (GAs), particle swarm  ...  Therefore, the SP problem turns out to be a dynamic optimization problem (DOP) in MANETs.  ...  The shortest path problem concerns with finding the shortest path from a specific source to a specific destination in a given network while minimizing the total cost associated with the path.  ... 
doi:10.1109/cec.2009.4983340 dblp:conf/cec/ChengY09 fatcat:fl6ruxahybee5nksypa2vdtusa

A dynamic programming solution of a shortest path problem with time constraints on movement and parking

N.G.F Sancho
1992 Journal of Mathematical Analysis and Applications  
A dynamic programming formulation of this type of shortest path problem would widen the scope of problems which can effectively be solved by dynamic programming.  ...  Recently a shortest path problem with restriction on time windows on the node was studied by Desrochers and Soumis [2] .  ...  However, their results just give one optimal solution.  ... 
doi:10.1016/0022-247x(92)90335-b fatcat:bjgibbtf2ngdxcaovbr37wpifm

An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph

Vianney Kengne Tchendji, Jerry Lacmou Zeutouo
2019 Data Science and Engineering  
Secondly, we propose a CGM parallel algorithm based on our dynamic graph to solve the OBST problem through one-to-all shortest paths in this graph.  ...  Firstly, we propose a dynamic graph model for solving the OBST problem and show that each instance of this problem corresponds to a one-to-all shortest path problem in this graph.  ...  Corollary 2 Any solution of a one-to-all shortest path problem can be used on our dynamic graph D n to solve OBST problem.  ... 
doi:10.1007/s41019-019-0093-9 fatcat:4yo22c4tqvct7hyun34bwrpvgq

Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks

Shengxiang Yang, Hui Cheng, Fang Wang
2010 IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)  
Index Terms-Dynamic optimization problem (DOP), dynamic shortest path routing problem (DSPRP), genetic algorithm (GA), immigrants scheme, memory scheme, mobile ad hoc network (MANET).  ...  In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization  ...  In this paper, we investigate the shortest path (SP) routing problem, which belongs to the topological routing.  ... 
doi:10.1109/tsmcc.2009.2023676 fatcat:233mlbcdczfprbofcmkcnmkphe

Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures

Camil Demetrescu, Giuseppe F. Italiano
2006 Journal of Discrete Algorithms  
In particular, we consider two fundamental problems: dynamic transitive closure and dynamic shortest paths.  ...  This is an annotated bibliography on fully dynamic algorithms for path problems on general directed graphs.  ...  Lower bounds for dynamic shortest path problems are studied in [39] . An extensive computational study on dynamic all pairs shortest path problems appears in [5] .  ... 
doi:10.1016/j.jda.2005.12.003 fatcat:dyr5qbndajfqzlppmiojqhen4e

Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks

I. Chabini, Shan Lan
2002 IEEE transactions on intelligent transportation systems (Print)  
This paper extends the A* methodology to shortest path problems in dynamic networks, in which arc travel times are time dependent.  ...  These lower bounds are exploited in designing efficient adaptations of the A* algorithm to solve instances of the one-to-one dynamic fastest path problem.  ...  dynamic shortest path problem.  ... 
doi:10.1109/6979.994796 fatcat:rcnja5ga55fephcdrhasksyxya

Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time

Ismail Chabini
1998 Transportation Research Record  
The all-to-one dynamic shortest paths problem and the one-to-all fastest paths problems are studied. Early results are revisited and new properties are established.  ...  A new and simple solution algorithm is proposed for all-to-one, all departure time intervals, shortest paths problems.  ...  This results in a new family of shortest paths problems known as dynamic, or time-dependent, shortest paths problems.  ... 
doi:10.3141/1645-21 fatcat:r7kbhtjdefc6thog63ibzunkqa

Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks

Camil Demetrescu, Giuseppe F. Italiano
2007 Electronical Notes in Theoretical Computer Science  
In this paper, we survey algorithms for shortest paths in dynamic networks.  ...  Although research on this problem spans over more than three decades, in the last couple of years many novel algorithmic techniques have been proposed.  ...  History of the Problem The first papers on dynamic shortest paths date back to 1967 [20, 22, 25] .  ... 
doi:10.1016/j.entcs.2006.11.006 fatcat:ss7kxtmk4fah5a5qmpxieln2be
« Previous Showing results 1 — 15 out of 128,923 results