Home // GEOProcessing 2018, The Tenth International Conference on Advanced Geographic Information Systems, Applications, and Services // View article

Using Smart A* Algorithm to Solve TSP Navigation Problem

Authors:
Hatem Halaoui

Keywords: Traveling Salesman Problem; Intelligent Navigation Algorithms; Smart Navigation; Hamilton circuit; A* Algorithm.

Abstract:
Navigation queries are very common among travelers. Moreover, traveling to multiple destinations in one trip is a common as well. The Traveling Salesman Problem (TSP) is one of the famous path multi-destination problems. Solving TSP efficiently with real-time factors (traffic, distance, real-time delays) is very useful for multiple navigation queries. Google maps, Yahoo maps, and many others are examples of such online navigation applications. Calculating the best driving path between multiple addresses is subject to many factors including distance, road situation, road traffic, speed limitations and others. This paper presents the use of smart heuristic functions, intelligent algorithm A*, traditional graph algorithms like Hamilton circuit, as well as efficient data structures in finding an efficient cycle path between multiple addresses.

Pages: 46 to 51

Copyright: Copyright (c) IARIA, 2018

Publication date: March 25, 2018

Published in: conference

ISSN: 2308-393X

ISBN: 978-1-61208-617-0

Location: Rome, Italy

Dates: from March 25, 2018 to March 29, 2018