SMART CITY TRAVELER

Yash Tyagi and Vaibhav Mangla

Department of Computer Science and Engineering
MEERUT INSTITUTE OF ENGINEERING AND TECHNOLOGY, MEERUT, UP
[email protected]
[email protected]

Abstract- We realize that the most valuable thing in our human life is time and managing
it effectively and living the most out of each and every moment is our greatest desire that’s
what today’s age of technology has best to offer. In this context, the proposed work as a
mobile application aims to provide an effective usage of time in a well-planned and
systematic manner so as the traveler while travelling gets the best out of each and every
place they visit. In order to accomplish that we propose an application-based system that
shows the optimal route and a planner within the time provided.

Key Words- Android Studio, Google Maps API, Firebase, travel, Planning, Guide

1. INTRODUCTION

At present, tourist and travelers spend a lot of time in planning and deciding the places they
should visit in a particular location that creates a lot of hassle and is also very time
consuming hence with this mobile application we aim to identify the essential
technological needs that will help in reducing the time and helps in deciding places to visit
from travelers' point of view.
Usually, most travelers love to visit the local charms and sightseeing spots that are particular
to that area. To accomplish that, we propose a mobile application which shows plan and
optimal travel route for the traveler. This application also
has faster decision making when it comes to choose the best optimal route based upon using
the GPS location data live from the traveler.
This application is basically meant for the traveler visiting a new place and look forward to
explore the best places within a particular duration. The traveler is made to enter their choice
preferences with area of interest at the time of signing up. On successful account
creation, the user has the option either let the system know their location and suggest places
around letting user to select starting and final location or enter the location manually.
Also, all the trips are stored within the separate travelling history section so that they can
view the places they have traveled so far. In addition, the application also suggests some
eating places according to the time duration specified like for Breakfast, lunch, snacks etc.
For Starting and completing the trip within the specified time, the application utilizes the
Shortest path Algorithm also the application makes use of Firebase for real time database
and Back-end. Its API lets the data to get synchronize and stored on the server.

2. METHODOLOGY

Existing System
The systems that exist currently, makes it mandatory that the traveler to enter name of
destination accurately. At some location, let’s just say related to sightseeing is chosen then
traveler does not have any problem for that they can use Google maps directly but what if
traveler likes to visit some new spot that is completely new then this system is not
desirable.

Existing system displays only known and most visited locations around the Traveler and
for that they have to choose the place and the path manually also Google maps shows the
route only to the destination while on the other side the proposed system plans whole trip
with destinations in between with return back to the selected places within time.

It also suggests recommendation on the route selected for a particular destination so as if

the user likes then they can stop by at those places unlike Google maps that just focuses on
primarily reaching to the final spot without letting traveler to explore the route in-between
if they want.
Also, the proposed system recommends places for Breakfast, Lunch, Snacks etc.
Depending upon the time duration selected for e.g. Breakfast Places all along the route if
the duration selected is 8 A.M. to 12 noon and Lunch if the selected traveling duration is
12 noon to 4 p.m.

Proposed System

The proposed system focuses on planning the entire journey for a particular time period with
taking returning back by the time specified the utmost preference. The system can thus
utilize the present time and sync the return time live relative to it.

The system also suggests the best places around as recommendation just in case traveler likes
to give them a try visiting.

The system also looks for any nearby places that can be added into the route if the returning
time permits.

The application displays assisting routes via maps and also by text. List of all categories of
main attractions is also included so if the user selects one place then all the related
information to that can be made available to them.
Android Studio

It’s the integrated software development environment (IDE) for Android application
development that is based upon the Intellij IDEA, that incorporates Developer tools and code
editing.

Each project within android studio has one or more than one modalities with resource files
and source code. These modalities comprise of library modules, Google app engine modules
and android app modules.

A code editor helps the developer in code completion, refraction and writing code.
Apps that are created in android studio are compiled into APK for publishing them on the
play store.

Firebase

It is a web and Smartphone application development platform that helps in delivering

greater application experiences. To make the workflow easy for the developer,
it assists them by providing online dashboard and development kits which are
interconnected and scalable.

The platform has greater level of tools. It can store document structured data and
synchronize that within a fraction of time whenever data addition takes place.

Google maps API

API’s are used for communicating the services provided by Google and their integration with
other services. Examples of such include Google maps, Gmail, Google search etc. The
API’S basically provide functionality like machine learning, user data retrieval, and analytics
and so on. In order to increase the functionality of the existing services the third party apps
makes the use of such API.
3. IMPLEMENTATION

3.1 Ant Colony Algorithm

This algorithm is inspired by observation of the actual colonies of ants and their behavior.
Ants are basically social as they live in colonies and their actual behavior is more towards
saving the colony than saving themselves as an individual self. Social creatures have drew
the attention of humans due to the high structural levels they can achieve as whole.
One important behavior of them is their foraging behavior and how they can find the shortest
path to a particular location from their nest.

Ants leave a chemical pheromones on their path because of which they are capable of
finding the shortest path. Ant as an individual while walking in the group prefers to follow
places that are pheromone rich. It acts as an indirect communication among individual to a
population comprise of artificial ants.

The biggest trait of ants is the manner in which they establish communication so as to find
the shortest path by the help of chemical they use i.e. pheromone.
The ant’s behavior as in colonies is used to solve the optimization problems.
Whole dependency of ants is based upon the state of pheromone.
The steps are well depicted below.

Fig. 1
3.2 Enhanced route recommendation Algorithm

This is basically a classification technique that is derived from the Bayes' Theorem assuming
the independence among predictors. Simply speaking, a naive imagining that there are n
location points in a particular area, the network topology is expressed as plot GV.

E( , ) , V is collection of scenic points , (i j, )∈E represents the bidirectional between node I

to j, E is collection of edges. CNR is current number of ride for node i. . Supposing that the
distance between two node i and j is dij and the travelling time is the sum of Path Statistical
Time tij and node average Stay Time Ti. S is the matrix of the statistical path selection, each
element sij in the matrix is the number of path from the node i to node j.

Actual motive for proposing the travel path plan problem within this paper is to form a travel
route that reduces the objective function that is measured by the congestion, the stay time
and costing of travelling and so on, satisfying constraints' as follows:

I.Time constraint for travelling

II.Travelers choice for node based on popularity of the place

III. Congestion situation at each node

This paper proposes an Enhanced route recommendation algorithm that solves the travel path
problem by utilizing a variety of constraints. The enhanced route recommendation algorithm
considers personal preference while visiting that place and other tourist choices (matrix T
and matrix S) and personal preference to calculate the recommended matrix and finally the
suggested path is calculated based upon RM.
3.3 A* Heuristic Algorithm

It is an algorithm that searches for the smallest path between starting and
terminating state. Its various applications include usage in maps and for all other
navigation purposes.

In maps particularly this algorithm primarily used for estimating the smallest
distance between starting and the terminating point.

It is a computer algorithm that is widely used in graph traversal and location

finding. This algorithm particular creates a walking route between various nodes
on graph.

Fig. 2
4. SYSTEM DESIGN

Fig 3

The above diagram shows the flow of activities of the user interface of the android
application for the Smart City Traveler.

5. CONCLUSION & DISCUSSION

Every technological advancement is letting humans to get the most out of every moment and
thus by utilizing the Smart city traveler application, the user saves a lot of time that else
would have been spent in planning and deciding the routes to be taken and in all other things.
Hence paying attention to traveling and exploring every place a user visits is the most crucial
thing that matters for the user and let rest of the work done by the application.
6. REFERENCES-

1. Route planning algorithm international journal for public council,2006

2. Routes study of ant colony algorithm by DR. Jung hang

3. https://www.geeksforgeeks.org/a-search-algorithm/

4. Route planning algorithm by k. Mastro

5. https://en.wikipedia.org/wiki/Firebase