KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

A Border Line-Based Pruning Scheme for Shortest Path Computations

  • Received : 2010.02.25
  • Accepted : 2010.10.06
  • Published : 2010.10.30
Download PDF
⟨ Previous Next ⟩

Abstract

With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, $A^*$ algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.

Keywords

References

  1. E.W Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, no. 1, pp. 269-271, Dec. 1959. https://doi.org/10.1007/BF01386390
  2. M. Holzer, F. Schulz, D. Wagner and T. Willhalm, "Combining Speed-up Techniques for Shortest-Path Computations," ACM Journal of Experimental Algorithmics, vol. 10, no. 2.5, 2005.
  3. Hart, P. E., Nilsson, N. J. and Raphael, B., "A Formal Basis for the Heuristic Determination of Minimum Cost Paths," IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, 1968. https://doi.org/10.1109/TSSC.1968.300136
  4. Sedgewick, R. and Vitter, J.S., "Shortest paths in Euclidean Space," Algorithmica, vol. 1, no. 1-4, pp. 31–48, 1986. https://doi.org/10.1007/BF01840435
  5. Shekhar, S., Kohli, A. and Coyle, M., "Path computation algorithms for advanced traveler information system (atis)," in Proc. of 9th IEEE International Conf. Data Eng., pp. 31–39, 1993.
  6. Jacob, R., Marathe, M. and Nagel, K., "A computational study of routing algorithms for realistic transportation networks," Journal of Experimental Algorithmics, vol. 4, no. 6, 1999.
  7. Schulz, F.,Wagner, D. and Andweihe, K., "Dijkstra's algorithm on-line: An empirical case study from public railroad transport," Journal of Experimental Algorithmics, vol. 5, no. 12, 2000.
  8. Pohl, I., "Bi-directional and heuristic search in path problems," Techical Report 104, Stanford Linear Accelerator Center, Stanford, CA. 1969.
  9. Ahuja, R., Magnanti, T., and Orlin, J., "Network flows: Theory, Algorithms, and Applications," Prentice–Hall, 1993.
  10. Kaindl, H. and Kainz, G., "Bidirectional heuristic search reconsidered," Journal of Artificial Intelligence Research, vol. 7, pp. 283–317, Dec. 1997.
  11. Pohl, I., "Bi-directional search," Machine Intelligence, vol. 6, American Elsevier, New York, pp. 127–140, 1971.
  12. Schulz, F., empirical, D., and Zarolliagis, C., "Using multi-level graphs for timetable information in railway systems," Lecture Notes in Computer Science, vol. 2409, Springer-Verlag, New York, pp. 43–59, Jan. 2002.
  13. Jung, S. and Pramanik, S., "An efficient path computation model for hierarchically structured topographical road maps," IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 5, pp. 1029–1046, Sept. 2002. https://doi.org/10.1109/TKDE.2002.1033772
  14. Jung, S. and Pramanik, S., "Hiti graph model of topographical road maps in navigation systems," in Proc. 12th IEEE International Conf. Data Eng, pp. 76–84, Mar. 1996.
  15. Wagner, D. and Willhalm, T., "Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs," Lecture Notes in Computer Science, vol. 2832, Springer-Verlag, New York, pp. 776–787, 2003.
  16. Graham, R.L., "An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set," Information Processing Letters, vol. 1, no. 4, pp. 132-133, Jun. 1972. https://doi.org/10.1016/0020-0190(72)90045-2
  17. Waxman, B.M., "Routing of multipoint connections," IEEE Journal on Selected Areas in Communications, vol. 6, issue 9, pp. 1617 – 1622, Dec. 1988. https://doi.org/10.1109/49.12889
  18. Brandes, U., Eiglsperger, M., Herman, I., Himsolt, M., Scott, M., "GraphML progress report," Lecture Notes in Computer Science, vol. 2265, Springer-Verlag, New York, pp. 501–512, 2001.

Cited by

  1. Shortest Alternate Path Discovery through Recursive Bounding Box Pruning vol.7, pp.2, 2010, https://doi.org/10.4236/jtts.2017.72012
  2. Shortest Alternate Path Discovery through Recursive Bounding Box Pruning vol.7, pp.2, 2010, https://doi.org/10.4236/jtts.2017.72012
  3. Shortest Alternate Path Discovery through Recursive Bounding Box Pruning vol.7, pp.2, 2010, https://doi.org/10.4236/jtts.2017.72012
  4. Shortest Alternate Path Discovery through Recursive Bounding Box Pruning vol.7, pp.2, 2010, https://doi.org/10.4236/jtts.2017.72012
  5. Shortest Alternate Path Discovery through Recursive Bounding Box Pruning vol.7, pp.2, 2010, https://doi.org/10.4236/jtts.2017.72012
  6. Shortest Alternate Path Discovery through Recursive Bounding Box Pruning vol.7, pp.2, 2010, https://doi.org/10.4236/jtts.2017.72012
  7. Shortest Alternate Path Discovery through Recursive Bounding Box Pruning vol.7, pp.2, 2010, https://doi.org/10.4236/jtts.2017.72012
  8. Shortest Alternate Path Discovery through Recursive Bounding Box Pruning vol.7, pp.2, 2010, https://doi.org/10.4236/jtts.2017.72012
  9. Shortest Alternate Path Discovery through Recursive Bounding Box Pruning vol.7, pp.2, 2010, https://doi.org/10.4236/jtts.2017.72012
  10. Shortest Alternate Path Discovery through Recursive Bounding Box Pruning vol.7, pp.2, 2010, https://doi.org/10.4236/jtts.2017.72012