Access Restriction

Author Shibuya, Tetsuo
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2000
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword $A^{*}$ algorithm ♦ GIS ♦ Algorithms ♦ Experimentation ♦ N × m shortest paths
Abstract Computation of all the shortest paths between multiple sources and multiple destinations on various networks is required in many problems, such as the traveling salesperson problem (TSP) and the vehicle routing problem (VRP). This paper proposes new algorithms that compute the set of shortest paths efficiently by using the $A^{*}$ algorithm. The efficiency and properties of these algorithms are examined by using the results of experiments on an actual road network.
ISSN 10846654
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2000-12-01
Publisher Place New York
e-ISSN 10846654
Journal Journal of Experimental Algorithmics (JEA)
Volume Number 5

Open content in new tab

   Open content in new tab
Source: ACM Digital Library