International Journal of Innovative Research in Computer Science and Technology
Year: 2014, Volume: 2, Issue: 1
First page : ( 58) Last page : ( 63)
Online ISSN : 2347-5552
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
Vijay Babar, , Sonali Jadhav, Pooja Jagtap, Ajendra Joshi
This paper aims to develop an Android Application that can provide optimal tour (shortest distance) for the selected locations using google maps. Using the optimal tour results in efficient use of time and fuel. In current situation of ever rising petrol prices and waste of valuable time in travelling, it’s wise to schedule and plan the tour such that it uses minimum resources. The Application tries to address this requirement. And since android has become a door-to-door technology with high processing power and is extremely mobile, it provides a perfect platform for such an Application. The clustering method for increasing number of nodes is also proposed in this paper, to reduce computation time complexity of the algorithm.
[1]Jeffrey Miller, Sun-il Kim, Timothy Menard Intelligent Transportation Systems Travelling Salesman Problem (ITS-TSP) - A Specialized TSP with Dynamic Edge Weights and Intermediate Cities”
[2]”Fundamentals of Computer Algorithms”, By Ellis Horowitz, Sartaj Sahani, Sanguthevar Rajasekaran, Published by University Press Limited.
[3] Amanur Rahman Saiyed, The Traveling Salesman problem Indiana State University Terre Haute, IN 47809 , USA
[4]Mark G. Eramian, TSP Problem, Greedy Algorithms, and Backtracking. University of Saskatchewan Based on notes by G. Cheston and J. P. Tremblay
[5] Jin-Qiu Yang,Jian-Ganh Yang, Gen-Lang Chen, “Solving large scale TSP using adaptive clustering methods”, IEEE, 2009.
[6] Prateek Agrawal , Harjeet Kaur , Pallavi Arora from Lovely Professional University, INDIA,“analysis and synthesis of enhanced ant colony optimization with the traditional ant colony optimization to solve travelling sales person problem”,International Journal of Computers & Technology Volume 2 No.2 April 2012.
[7]R.sivaraj, dr.t.ravichandran, r.devi priya,“Solving Traveling Salesman Problem usingClustering Genetic Algorithm”International Journal on Computer Science and Engineering (IJCSE) ,Vol. 4 No. 07 July 2012 .
[8]Developer.android.com
[9]”Android Cookbook”, By Ian F. Darwin, Published By O'Reilly Media
[10]”Professional Android 4 Application Development”, By Reto Meier, Published By John Wiely & Sons.
[11] Supawadee Charoenwiengwechakij, Tanasanee Phienthrakul, “Solving traveling salesman problems with k-means clustering genetic algorithm.”
BE (Computer), Pimpri Chinchwad College of Engineering, Pune-411044,India
No. of Downloads: 17 | No. of Views: 2721
Manali Shukla, Ishika Goyal, Bhavya Gupta, Jhanvi Sharma.
July 2024 - Vol 12, Issue 4
Dipti Prajapati, Samishtarani Sabat, Sanika Bhilare, Rashmi Vishe, Prof. Suman Bhujbal.
March 2024 - Vol 12, Issue 2
Anu Sharma, Vivek Kumar.
May 2023 - Vol 11, Issue 3
