DocumentCode
3378035
Title
An innovative TESOR Algorithm for perfect routing
Author
Prathap, P. M. Joe ; Brindha, G.R.
Author_Institution
IT Dept., SASTRA Univ., Thanjavur, India
fYear
2011
fDate
21-22 July 2011
Firstpage
121
Lastpage
126
Abstract
In this 21s´ 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.
Keywords
customer satisfaction; customer services; graph theory; optimisation; retailing; Dijkstra algorithm; Time and Energy Saving Optimal Routing; innovative TESOR algorithm; optimal routing graph; perfect routing; shop selection; shopping; Algorithm design and analysis; Computer architecture; Conferences; Educational institutions; Routing; Signal processing; Signal processing algorithms; energy efficient; optimisation; routing; shortest path;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing, Communication, Computing and Networking Technologies (ICSCCN), 2011 International Conference on
Conference_Location
Thuckafay
Print_ISBN
978-1-61284-654-5
Type
conf
DOI
10.1109/ICSCCN.2011.6024527
Filename
6024527
Link To Document