An innovative TESOR Algorithm for perfect routing

In this 21st century people are looking for faster and efficient actions in each and every activities they involved. In this modern world, shopping is an inseparable & essential activity. But in reality it creates lot of stress and utilizes not only our time but also energy. Nowadays all kind of shops are available together in a location, but still confusion and unnecessary wandering are unavoidable. This paper proposes a novel idea called TESOR (Time and Energy Saving Optimal Routing) algorithm using Dijkstra algorithm as a base one. The target domain of this paper is that of providing 100% end user satisfaction. It further explores the simulation results and some new future directions.

[1]  Jayadev Misra.  A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation , 2001, Inf. Process. Lett..

[2]  W. G. Rees,et al.  Least-cost paths in mountainous terrain , 2004, Comput. Geosci..

[3]  Rami G. Melhem,et al.  An efficient algorithm for constructing delay bounded minimum cost multicast trees , 2004, J. Parallel Distributed Comput..

[4]  Er. Waghoo Parvez,et al.  Path planning in construction sites : performance evaluation of the Dijkstra , A * , and GA search algorithms , 2013 .

[5]  Allan Gottlieb,et al.  A generating function approach to the Traveling Salesman Problem , 1977, ACM Annual Conference.

[6]  Tibor Cinkler,et al.  On shortest path representation , 2007, IEEE/ACM Trans. Netw..

[7]  Jeffrey K. Uhlmann,et al.  An Efficient Algorithm for Computing Least Cost Paths with Turn Constraints , 1998, Inf. Process. Lett..

[8]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[9]  Yuan Yuan,et al.  Path selection model and algorithm for emergency logistics management , 2009, Comput. Ind. Eng..

[10]  Hissam Tawfik,et al.  Path planning in construction sites: performance evaluation of the Dijkstra, A*, and GA search algorithms , 2002, Adv. Eng. Informatics.

[11]  JinFu Leng,et al.  An Improved Shortest Path Algorithm for Computing One-to-One Shortest Paths on Road Networks , 2009, 2009 First International Conference on Information Science and Engineering.

[12]  Shu-Cherng Fang,et al.  The Point-to-point Connection Problem - Analysis and Algorithms , 1997, Discret. Appl. Math..

[13]  R. Bellman.  COMBINATORIAL PROCESSES AND DYNAMIC PROGRAMMING , 1958 .

[14]  Clifford Stein,et al.  Long tours and short superstrings , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[15]  Domenico Cantone,et al.  Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm , 2004, Electron. Notes Discret. Math..

[16]  Shan Zhu,et al.  A New Parallel and Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks , 1998, IEEE Trans. Parallel Distributed Syst..

[17]  A new distributed shortest path algorithm for hierarchically clustered data networks , 1995, Proceedings of 1995 American Control Conference - ACC'95.

[18]  Jesper Larsson Träff,et al.  An Experimental Comparison of two Distributed Single-Source Shortest Path Algorithms , 1995, Parallel Comput..

[19]  George W. Rogers,et al.  Fast computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints , 1995, Neurocomputing.

[20]  Moshe Lewenstein,et al.  Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2005, JACM.