A border line-based pruning scheme for shortest path computations

JinKyu Park, Daejin Moon, Een Jun Hwang

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)939-955
Number of pages17
JournalKSII Transactions on Internet and Information Systems
Volume4
Issue number5
DOIs
Publication statusPublished - 2010 Oct 1

Fingerprint

Containers
Location based services
Costs
Experiments

Keywords

  • Border-line
  • Convex hull
  • Dijkstra's algorithm
  • Minimum bounding rectangle
  • Path-finding
  • Pruning method
  • Shortest path container

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

A border line-based pruning scheme for shortest path computations. / Park, JinKyu; Moon, Daejin; Hwang, Een Jun.

In: KSII Transactions on Internet and Information Systems, Vol. 4, No. 5, 01.10.2010, p. 939-955.

Research output: Contribution to journalArticle

@article{f582c3c83b574606aebe64b42555de56,
title = "A border line-based pruning scheme for shortest path computations",
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 = "Border-line, Convex hull, Dijkstra's algorithm, Minimum bounding rectangle, Path-finding, Pruning method, Shortest path container",
author = "JinKyu Park and Daejin Moon and Hwang, {Een Jun}",
year = "2010",
month = "10",
day = "1",
doi = "10.3837/tiis.2010.10.014",
language = "English",
volume = "4",
pages = "939--955",
journal = "KSII Transactions on Internet and Information Systems",
issn = "1976-7277",
publisher = "Korea Society of Internet Information",
number = "5",

}

TY - JOUR

T1 - A border line-based pruning scheme for shortest path computations

AU - Park, JinKyu

AU - Moon, Daejin

AU - Hwang, Een Jun

PY - 2010/10/1

Y1 - 2010/10/1

N2 - 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.

AB - 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.

KW - Border-line

KW - Convex hull

KW - Dijkstra's algorithm

KW - Minimum bounding rectangle

KW - Path-finding

KW - Pruning method

KW - Shortest path container

UR - http://www.scopus.com/inward/record.url?scp=78449240337&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78449240337&partnerID=8YFLogxK

U2 - 10.3837/tiis.2010.10.014

DO - 10.3837/tiis.2010.10.014

M3 - Article

VL - 4

SP - 939

EP - 955

JO - KSII Transactions on Internet and Information Systems

JF - KSII Transactions on Internet and Information Systems

SN - 1976-7277

IS - 5

ER -