Abstract
The edges of a graph are assigned weights and passage times which are assumed to be positive integers. We present a parallel algorithm for finding the shortest path whose total weight is smaller than a pre-determined value. In each step the processing elements are not analyzing the entire graph. Instead they are focusing on a subset of vertices called active vertices. The set of active vertices at time t is related to the boundary of the ball \(B_t\) of radius t in the first passage percolation metric. Although it is believed that the number of active vertices is an order of magnitude smaller than the size of the graph, we prove that this need not be the case with an example of a graph for which the active vertices form a large fractal. We analyze an OpenCL implementation of the algorithm on GPU for cubes in \(\mathbb Z^d\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
G. Amir, I. Corwin, J. Quastel, Probability distribution of the free energy of the continuum directed random polymer in \(1+1\) dimensions. Comm. Pure Appl. Math. 64, 466–537 (2011)
S. Armstrong, H. Tran, Y. Yu, Stochastic homogenization of a nonconvex Hamilton–Jacobi equation. Calc. Var. Partial Differential Equations, 54, 1507–1524 (2015). (Submitted) arXiv:1311.2029
M. Benaim, R. Rossignol, Exponential concentration for first passage percolation through modified poincaré inequalities. Ann. Inst. Henri Poincaré Probab. Stat. 44(3), 544–573 (2008)
I. Benjamini, G. Kalai, O. Schramm, First passage percolation has sublinear distance variance. Ann. Probab. 31(4), 1970–1978 (2003)
N. Boland, J. Dethridge, I. Dumitrescu, Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34, 58–68 (2006)
S. Chatterjee, P.S. Dey, Central limit theorem for first-passage percolation time across thin cylinders. Probab. Theory Relat Fields 156(3), 613–663 (2013)
J.T. Cox, R. Durrett, Some limit theorems for percolation processes with necessary and sufficient conditions. Ann. Probab. 9(4), 583–603 (1981)
M. Damron, M. Hochman, Examples of nonpolygonal limit shapes in i.i.d. first-passage percolation and infinite coexistence in spatial growth models. Ann. Appl. Probab. 23(3), 1074–1085 (2013)
M. Desrochers, J. Desrosiers, M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2), 342–354 (1992)
J. Hammersley, D. Welsh, First-passage percolation, subadditive processes, stochastic networks, and generalized renewal theory. in Bernoulli-Bayes-Laplace Anniversary Volume1965
S. Irnich, G. Desaulniers, Shortest path problems with resource constraints. in Column Generation, ed. by G. Desaulniers, J. Desrosiers, M. M. Solomon. GERAD 25th Anniversary Series (Springer, 2005), pp. 33–65
E. Köhler, R.H. Möhring, H. Schilling, Acceleration of shortest path and constrained shortest path computation. Lect. Notes Comput. Sci. 3503, 126–138 (2005)
E. Kosygina, F. Rezakhanlou, S.R.S. Varadhan, Stochastic homogenization of Hamilton-Jacobi-Bellman equations. Comm. Pure Appl. Math. 59(10), 1489–1521 (2006)
E. Kosygina, F. Yilmaz, O. Zeitouni, Nonconvex homogenization of a class of one-dimensional stochastic viscous Hamilton-Jacobi equations, in preparation (2017)
J. Krug H. Spohn, Kinetic roughening of growing surfaces. Solids Far Equilib. 412–525 (1991)
X.-Y. Li, P.-J. Wan, Y. Wang, O. Frieder, Constrained shortest paths in wireless networks, in IEEE MilCom (2001), pp. 884–893
L. Lozano, A.L. Medaglia, On an exact method for the constrained shortest path problem. Comput. Oper. Res. 40(1), 378–384 (2013)
I. Matic, Parallel algorithm for constrained shortest path problem in C++/OpenCL. https://github.com/maticivan/parallel_constrained_shortest_path
I. Matic, J. Nolen, A sublinear variance bound for solutions of a random Hamilton-Jacobi equation. J. Stat. Phys. 149, 342–361 (2012)
K. Mehlhorn, M. Ziegelmann, Resource constrained shortest paths. Lect. Notes Comput. Sci. 1879, 326–337 (2000)
S. Misra, N.E. Majd, H. Huang, Approximation algorithms for constrained relay node placement in energy harvesting wireless sensor networks. IEEE Trans. Comput. 63(12), 2933–2947 (2014)
R. Muhandiramge, N. Boland, Simultaneous solution of lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem. Networks 53, 358–381 (2009)
C.M. Newman, M.S.T. Piza, Divergence of shape fluctuations in two dimensions. Ann. Probab. 23(3), 977–1005 (1995)
F. Rezakhanlou, Central limit theorem for stochastic Hamilton-Jacobi equations. Commun. Math. Phys. 211, 413–438 (2000)
T. Sasamoto, H. Spohn, One-dimensional kardar-parisi-zhang equation: An exact solution and its universality. Phys. Rev. Lett. 104 (2010)
P.E. Souganidis, Stochastic homogenization of Hamilton-Jacobi equations and some applications. Asymptot. Anal. 20(1), 1–11 (1999)
Acknowledgements
The author was supported by PSC-CUNY grants \(\#68387-00 46\), \(\#69723-00 47\) and Eugene M. Lang Foundation.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Matic, I. (2018). A Parallel Algorithm for the Constrained Shortest Path Problem on Lattice Graphs. In: Adamatzky, A. (eds) Shortest Path Solvers. From Software to Wetware. Emergence, Complexity and Computation, vol 32. Springer, Cham. https://doi.org/10.1007/978-3-319-77510-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-77510-4_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-77509-8
Online ISBN: 978-3-319-77510-4
eBook Packages: EngineeringEngineering (R0)