Bus Route Advisory Algorithms and

Services
Akshaya Srivatsa, Student,
th
6 Semester Telecommunication Engineering,
Vishweswaraya Technological University, PESIT, Bangalore

Abstract of the software. The software will provide all the

Public transport system plays an important role in necessary information-like bus stops, intermediate
any city as thousands of people depend on it for bus interchange stops, buses to board, timings, and
their transportation in the city. Over the past few frequency - required for the user to move between
decades, cities have been growing at a tremendous any two stops in the city. With spell check
pace in every aspect, including the public transport algorithms like Metaphone[10] and Soundex[09],
services. This paper is restricted to the discussion of the user need not know the accurate spelling of stop
the most popular type of public transport system names too. A rough estimate of the spelling is
namely the metropolitan bus service. More buses are sufficient to find out the routes that the user is
being added every year and more routes are being interested in. The software implements a novel
designed to cater to the needs of the growing cities, implementation of Dijkstra’s algorithms[15] to wotk
especially in emerging countries like India. As a in linear time.
result, bus routes are getting complicated with time
and identifying the best route to reach your Today Short Message Service [SMS-03] is highly
destination has become quite a tedious process. inexpensive (from 1 paise to about 50 paise per
When we say best route, we must strive to optimize message). With the growing usage of mobile phones
on time and distance and hence money. The case and low priced SMS, we ultimately plan to enable
study detailed in this paper is about Bangalore the above mentioned services on mobile phones.
Metropolitan Transport Corporation [BMTC-01], a
government body offering passenger transport
services to Bangalore city. However this solution Introduction
can be extended to any other passenger bus service Before defining the problem statement, I would like
in another city. to bring out the problems faced by the passengers in
the current bus systems. Based on the case study of
From a passenger point of view, identifying routes is BMTC, the following points give us a good picture
very complicated simply because of the enormous of the problems faced in any bus service in general.
size of public transport systems (For bus services, a
count of number of bus stops or bus routes can be of • BMTC has over 1700 bus routes in the city
the order of few thousands). One of the many and the public is not aware of the existence
solutions is to employ grid based bus services[Grid- of many of these routes. Each traveler tries
02], which can reduce the number of bus routes. to remember only a few routes numbers.
This is exactly what BMTC is implementing. But the • Travelers and tourists visiting the city find it
fact remains that, no matter how simple the bus tough to identify the best route to their
routes become, it is always tough to find the best destination, as they are not aware of the bus
route between two stops. routes, bus numbering schemes etc.
• Even the residents of the city make the
This paper talks about designing a software
mistake of boarding the same bus and over
solution, which can suggest routes between any two
crowding it, when in fact there are sufficient
stops in the city, after optimizing on time and
buses and bus routes in any given direction.
distance. The user need not know any information
This is because of the fact that many are
about the bus routes in the system prior to the using
unaware of the existence of other bus routes
 and frequencies, as mentioned in point Identifying the optimum route is not an “Impossible”
number 1. task, but it is a complex task for human beings
• In a city like Bangalore, there are around because it requires lot of storage, computation and
1200 bus stops (including the main bus calculations, which is beyond the intended functions
stations). ‘Picture 1’ gives us an idea of the of the human brain. But in today’s world, computers
“Density of stops in a city”. The red dots are used in every possible field. One field in which
represent the bus stops. computers beat human beings hands down is-
• ‘Picture 2’ shows that it is not possible to Computation .
pack the entire bus route information on a
single board due to its small dimensions With current technologies, calculations or
(unless an electronic board is used, which is computation can now be performed at phenomenal
quite expensive). As a result, identifying the speeds, taking only a fraction of a second which
right bus route between two points in the otherwise would have taken hours or even days for
city just by looking at the bus number or by any human being.
trying to read the bus route map is quite a
complicated and a tedious process. In short, using a computer to find out the best route
is one of the many solutions to the above specified
problems and it is this solution we now describe.

Problem Statement

“To design a software, which can suggest routes

between any two stops in the city, after optimizing
on time and distance. The software must be highly
user friendly so that the user need not have
knowledge about the bus system, prior to using the
software. With the growing usage of mobile phones
and low priced SMS, ultimately this service must be
made available on mobile phones via Short
Message Service[SMS].”
Picture1: A portion of the BMTC bus stops map (Red dots
represent the bus stops)
Courtesy: BMTC and Integra Systems and Services Solution
The solution to the problem, as given in the problem
statement, starts with designing an algorithm to
identifying the routes.

The Algorithm
Requirements

I. The parameters passed by the user to the program

as follows:
1. The Starting Point Bus Stop-Mandatory
2. The Ending Point Bus Stop-Mandatory
3. Time at which the user intends to start his
journey-Optional
Picture 2: A picture of a bus route information board of the bus
Irrespective of whether the third parameter is present
Courtesy:
http://www.primarystuff.co.uk/photos/albums/pics/More_Maths/ or not, there is no route defined without the first two
normal_bus_number.jpg parameters.
II. This paper will focus on only 3 types of bus Note that the entire city map is partitioned
routes. into grids. More information on this will
1. Direct bus routes follow.
2. Bus routes with one interchange point
3. Grid bus routes Interchange Points

III. All the bus routes and bus stop information must This is a table that contains a subset of all the stops
be present in a database having the following tables in the city. This table has those stops in the city
where many different bus routes intersect and these
Bus routes stops are ideal places to change buses.
This table has complete information on the different The schema is as follows
bus routes in the city. The schema is given as 1. Bus stop or Interchange point name.
follows. Assume that A is the starting point for a 2. Grid location of the stop.
bus.
1. Bus Number or the Route Number, say B The Routes table (Table III) is based on the fact that
2. Total time of journey between Bus Stand A a given bus in many cities in India (like Bangalore
and Bus Stand B. city) keeps shuttling between the same two bus
3. Total distance of the journey between Bus stands all day (Bus Stand A and Bus Stand B) and
Stand A and Bus Stand B. visits all the stops in its route in its journey.
4. Average time between the buses leaving the
bus stand A (avg_to). Every bus stop is best understood when viewed as a
5. Average time between the buses leaving the point in a 2-dimensional space, where the space is
bus stand B(avg_fro). the city itself. We can either associate a co-ordinate
6. All the time-ordered stops the bus B visits as with every stop or employ a “Grid Square
it plies between bus stand A and bus stand B map”[04]. To identify the routes and stops visited
all day. between a starting point and an ending point, it is
better to employ the latter system.
Example: For route number ‘10’, “K R Market” is A simple definition of Grid Square map is given
Bus stand A and “JP Nagar 6Th Phase” is Bus stand below.
B and all the stops it visits are stored as shown “A Grid is a set of numbered rows and lettered
below columns (or vice versa) superimposed on a map to
identify a given small area on the map or the
:K R MARKET:MAHILA features of the map”[05] .
SAMAJ/OKKALIGARA ‘Picture 3’ is an example of a grid square map for
SANGHA:TAXI STAND:SOUTH END Bangalore city.
CIRCLE:JAYANAGAR 5TH
BLOCK:JP NAGAR 24TH MAIN 9TH Bounding
Rectangle
CROSS:JP NAGAR 6TH PHASE:

Note that the bus stops are separated by colon ‘:’

characters.
The other tables in the database are STOP A

Bus Stops STOP B

This table contains all the stops in the city. The

schema is as follows
1. Bus stops name Picture 3: Grid map of Bangalore city Courtesy:
2. Grid location of the stop. This gives us the http://www.indianholiday.com
grid square in which the stop is located in.
Now consider two stops, ‘Stop A’ located in the For direct routes we need to look for those bus
square C5 and ‘Stop B’ located in the square B3 as routes where both the starting and ending stops are
shown in the ‘Picture 3’. Any bus route between present in the ‘route’. There may be many direct bus
these two stops that we are interested in has to lie routes and some direct bus routes may not be
within that rectangle on the grid-map, which advantageous. So we use the metric to filter out all
contains both the stops within itself. Such a those routes in which we are not interested. This is
rectangle is called as “Bounding Rectangle”[06]. done by choosing those routes whose metric gives us
The red rectangle in ‘Picture 3’ represents a a value greater than a “Threshold value”.
bounding rectangle for A & B.
Bus routes with one interchange point:
The above statement is made under the assumption This means that to reach the destination, the
that any route lying outside the bounding rectangle passenger needs to change buses at a particular
has to be longer than the routes inside the rectangle. interchange points. This approach is necessary as
This is a fair assumption as this assumption will hold there may not be direct buses between the given two
true for a majority of the routes if not for all. stops in the city.
Here we plan to use an adaptation of Dijkstra’s
Now within the bounding rectangle, the set of all algorithm. The original Dijkstra’s algorithms is
routes to move from a given origin stop to general for N hops graphs and computationally
destination stop is quite large, in which most of the longer. Since our problem is restricted to a
routes are either too long or too time consuming or maximum of two hops, we can reduce the time
both. So we are interested in finding that subset of complexity of the Dijkstra’s algorithm by
routes which are both time and distance optimized. eliminating the steps involved in identifying
To find this, its important to design a metric[07]. tentative & permanent nodes.

“Metrics” as given by Wikipedia[08], is defined as Interc hange

Staring Stop Ending Stop
follows. Point

“Metrics are a system of parameters or ways of

quantitative and periodic assessment of a process Flow Chart: Direct Bus Route
that is to be measured, along with the procedures to
carry out such measurement and the procedures for
the interpretation of the assessment in the light of
previous or comparable assessments.”. In simpler
terms, metric is a way to measure a quantity in any
process.

In our process, we need a metric to distinguish

between ‘Advantageous routes’ and ‘Routes that do
not give us time and distance advantage’.
A simple metric that I have employed is given below

Metric for routes = (K x froute no)/Da,b,

where
froute no = frequency of bus route which is (avg_to)-1
or (avg_fro)-1 depending upon the direction of the
route.
Da,b = distance between stop a and stop b.
K = A scaling factor
The lager the metric is, the more advantageous it
is.

Direct bus routes:

So the steps involved in finding the route are as Flow Chart: Bus Route With One Interchange
follows

1. After identifying the bounding rectangle, we

need to identify all the interchange points
within the bounding rectangle from the table
‘Interchange points’ from the database.
2. Choose a new interchange point, Ij
3. Are there buses from starting point (A) to
intermediate point (Ij) and from Ij to ending
point (B)? If yes, go to step 4 else go to step
2. This step is used to identify only those
interchange points through which a route
between A and B exits.
4. Calculate the metric for each bus routes
between A and Ij and the bus route between
Ij and B.
5. Add all the metrics to form a new metric
associated with the interchange point called
as ‘METRICj’.
6. If all the interchange points have been
exhausted, go to step 7 else go to step 2.
7. Larger the value of METRICj is, the better is
the rote through that interchange point.
Arrange all the interchange points in the
decreasing order of their value, so that the
best routes appear first and the worst appear
at the end of the list.
8. Sometimes a certain route may give a very
good value of metric and yet will give a
route that may be extremely long. Hence, in
terms of priorities, the length of the route
must be placed higher than the metric. So
select only those routes whose route lengths
are less than a threshold value– say 1.3
times the average route length between the
two stops. So this step is essentially used to
“Filter” out the routes from the best
available routes.
9. Display all the results.

Now each metric associated with the interchange

point tells us how advantageous it is to travel by via
interchange point. Larger the metric, better is the
interchange point and more advantageous it is. ‘Flow
Chart 2’ represents the flowchart for this algorithm.
Grid Bus Routes: The advantages with grid bus routes system are:
This system is most likely going to replace all the 1. Trunk Routes are typically on high traffic
previously mentioned system in many cities, if not roads while feeders are local to the area.
all. This system makes the understanding of the bus Hence we can see that there is a well defined
system simpler than with arbitrary routes running all “Logic” in the entire system unlike the
over the city. current system which has random ways of
designing routes. This is analogous ‘bus
Grid bus routes consist of based hardware design’ vis-à-vis random
• TR, Trunk Routes, which are routes that run connections. It can also be compared with
across the city. They cover major stops and the way ‘internet’ or ‘telephone network’ are
stations of the entire city but do not cover designed.
the smaller stops located within areas. In 2. The entire city can be covered with very few
other words, they help you move from one Trunk Routes and hence the number of trunk
area in the city to another area. Typically routes that is needed will be much less than
these routes run in north-south and east-west the current system. In the case of Bangalore,
directions. BMTC is yet to implement Grid Based
• FDR, Feeder Routes, which are routes that services on full swing. But they say that they
cover the smaller stops local to an area. have identified 15 Trunk Routes for the
They typically keep moving in a circular entire city, which is much better than current
fashion and are confined to smaller regions 1700 randomly oriented bus route system in
of the city like residential area, cross roads the city.
of the locality etc. 3. One of the problems with the current system
is that there is no proper distribution of the
To move from starting point A to end point B, we load across different bus routes. These two
need a combination of Trunk routes and Feeder are totally eliminated in Grid Routes as
routes. The passenger has to move from his stop to trunk routes are uniformly distributed over
the closest trunk route stop by using one of the the city and frequency of buses is kept quite
Feeder buses. He must then travel by trunk routes to uniform in the entire city.
reach that stop which is closest to his destination. He 4. An immediate consequence of point 3 is that
must then use the feeder service local to that area to the algorithm to find out the best routes from
move to his final destination. STA to END is simpler than the current
system because the metric can be made
Let the starting point be STA and end point be END. independent of frequency.
5. Routes are also easier to understand for an
An overview of the Algorithm (not the exact average user. Locations once expressed in
algorithm) grid coordinates will allow users to figure
1. Identify the locations of the two stops (STA out a way to use a combination of routes.
and END) in terms of the grid location as we
discussed earlier. As of now, this concept is yet to be tested as there is
2. Find the closest trunk stops for starting and no city/town in the country that uses gird based
ending points. Let the trunk stop closest to service. BMTC would be the first to implement this
STA be TR-STA and that closest to END be concept and hence we can test only after we get a
TR-END. database on grid based services.
3. Find the Trunk Routes (TR’s) that connect
the TR-STR and TR-END. Search Tool
4. Find the feeders that help the passenger to
move from STR to TR-STR. A city will have thousands of stops in itself. In the
5. Find the feeders that help the passenger case of Bangalore city, it has close to 1200 stops.
move from TR-END to END Etymologically, the stop names have local language
6. Display the results.
origin. Hence spelling the names in English may not written for “Duplicate Entry Elimination” and ”Fault
be unique. But the database contains a unique name elimination”. In the end I have developed an error
for each stop. So it becomes necessary to develop a free database of the current bus system in Bangalore.
dictionary of the stop names as given in the
database, so that even when the user enters a spelling For the SMS implementation, there are numerous
of a stop different from that present in the database, SMS Gateway products. Currently for testing
an algorithm can be used to find the closest purposes, I have used NowSMS SMS/MMS
matching stop name as given in the dictionary. gateway[13] Trial Edition software. The GSM
Hence this closest match can now be used to find the modem used for testing purposes was Sony
routes. Ericsson K700i [15]GSM Mobile Phone. Any
mobile phone can be used as a GSM modem. There
The algorithms we have used are Soundex [09] and are also PC Card based GSM modems manufactured
Metaphone[10]. These are phonetic algorithms that by Nokia, Sony Ericsson and Panasonic etc
assign different numerical values to different
syllables and alphabets and hence return an alpha-
numeric representation of the word. The algorithms
Results
many not be the best one but they are quite immune
The algorithm has been successful in generating
to spelling errors and return the actual spelling that
direct bus routes and one stop interchange routes,
the user was referring to.
which have both distance and time optimization.
Spell check algorithms can find the exact spelling of
Using a dictionary consisting of stop names given in
the route even if the user to makes 3-4 mistakes in
the database (after lot of cleaning of raw data in the
spelling the bus stop. The implementation of the
original DB), we have successfully been able to
algorithm in the form of a web tool (JSP), stand
implement the search tool.
alone desktop tool (JFC SWING) and SMS service
has worked as expected without any errors. The
sample results obtained from the above mentioned
tools are given below.
Implementation
Spell Check
The entire software has been developed on Java • KAVERI NAGAR is the actual spelling of a
Platform. Using Java Swing GUI Toolkit[11], there particular stop in the city. The following
is a stand alone version of the software. A web based misspelled names when entered still gave
implementation is based on Java Server Pages KAVERI NAGAR as the result.
(JSP)[12] using Apache TomCat JSP server[13]. KAVERI ANGAR, KAVERUNAGAR,
The user can either search the stops name based on KAVER NAGAR, KAVERNGAR etc
the starting letter of the stop name or by entering the • Similar test was performed on A
stop name. This will give him a subset of all the NARAYANPURA and the results were the
stops starting with the given letter. Also, the user can same for following spellings entered
enter the name of the stop itself. The software will ANARAYANPURA, A NARYANPURA,
give you the closest matching stop names. A NARAYANAAPURA etc

Most important requirement of the software is the Bus Routes

database. I have used MySQL Database
Management Software[14] for this purpose. The Bangalore city has 1200 stops as mentioned before.
discussion of populating our database is beyond the Mapping all the 1200 stops into the DB needs a lot
scope of this paper and hence would like to give you of man power and effort and hence only about 120
the gist of the database. Using “Screen scraping” stops from 6 grid locations ( D4, D5, D6, E4, E5 and
techniques[12], I was able to extract 1700 bus E6) were mapped as shown in Picture 4 for testing.
routes’ information present in from the BMTC Some routes were tested and the program was able
website[01]. Different methods and algorithms were to successfully come out with well optimized routes.
The following results were obtained from the JSP The Buses From "BINNY LAYOUT" To "KEMPEGOWD BUS
STATION" are as follows >>>
version of this tool. 87A , 87B , 87C , P87 ,

The Buses From "KEMPEGOWD BUS STATION" To

1. Routes from BANASHANKARI BUS STAND "YESHWANTHAPURA BUS STATION" are as follows >>>
TO KEMPEGOWDA BUS STAND 250D , 250E , 251 , 251A , 251B , 252D , 252G , 252T , 253A , 253K ,
254 , 254A , 254D , 255 , 255A , 255B , 255E , 255F , 256B , 256D ,
257A , 257D , 258A , 258E , 258F , 258G , 258H , 258L , 258M , 263A ,
263B , 263C , 263D , 263E , 369K , 52E , 82C , 83C , 90E , 98A , 98E ,
The Direct Buses From "BANASHANAKARI BUS STATION" To P16 ,
"KEMPEGOWD BUS STATION" are as follows

ROUTE 2
12 , 211J , 22.9 , 12E , 14A , 210CA , 210E , 211B , 211L , 213N , 215G
, 215J , 215N , 215O , 215R , J14 , P21 ,
The Buses From "BINNY LAYOUT" To "SWASTHIK" are as follows
>>>
The routes where you have to change once are as follows. 63A ,

ROUTE 1 The Buses From "SWASTHIK" To "YESHWANTHAPURA BUS

STATION" are as follows >>>
1 , 173 , 1A , 23 , 42 , 47 , 79A , 98E ,
The Buses From "BANASHANAKARI BUS STATION" To
"SWASTHIK" Are As Follows >>>
14 , ROUTE 3

The Buses From "SWASTHIK" To "KEMPEGOWD BUS STATION" The Buses From "BINNY LAYOUT" To "NAYANDA HALLI" are as
are as follows >>> follows >>>
104 , 105A , 276N , 98E , TR6 , 87B ,

ROUTE 2 The Buses From "NAYANDA HALLI" To "YESHWANTHAPURA

BUS STATION" are as follows >>>
401R ,
The Buses From "BANASHANAKARI BUS STATION" To
"LEPROSARIUM" are as follows >>>
214F ,
3. Routes From VIVEKANANDA NAGAR To
NAVARANG TALKIES
The Buses From "LEPROSARIUM" To "KEMPEGOWD BUS
STATION" are as follows >>>
The Are No Direct Buses From "VIVEKANANDA NAGAR" To
196 , 243F , 61D , 61G , 61H , 87C ,
"NAVARANG TALKIES"

ROUTE 3
ROUTE 1

The Buses From "BANASHANAKARI BUS STATION" To "MM

The Buses From "VIVEKANANDA NAGAR" To "KEMPEGOWD
INDUSTRIES" are as follows >>>
BUS STATION" are as follows >>>
PK21 , 14A , 23A , P21 ,
146A , 276N , 43A ,
The Buses From "MM INDUSTRIES" To "KEMPEGOWD BUS
The Buses From "KEMPEGOWD BUS STATION" To "NAVARANG
STATION" are as follows >>>
TALKIES" Are As Follow >>>
12C , 14A , 15C , 15E , 15G , 15H , 15L , 210A , 210R , 210U , JPV15H
89C , JPV80A , P11 , P80 , P80A ,
, JPV210A , P21 , PK210A ,

ROUTE 2

The Buses From "VIVEKANANDA NAGAR" To "SIRSI CIRCLE" are

2. Routes From BINNY LAYOUT To as follows >>>
192 ,
YESHWANTHPUR BUS STAND
The Buses From "SIRSI CIRCLE" To "NAVARANG TALKIES" are as
follows >>>
J91D , P91D ,
The Are No Direct Buses From "BINNY LAYOUT" To
"YESHWANTHAPURA BUS STATION"
SMS
The routes where you have to change once are as follows.
In every SMS Gateway, like in NowSMS, there is an
ROUTE 1 option for executing certain shell commands when
the server receives an SMS. The format for the SMS Shekar Borgaonkar (Director Of HP Laboratories,
chosen is India) for their support and guidance.
“STARTING POINT <space> ENDINGPOINT”. Abbreviations
When the server receives an SMS in the above BMTC Bangalore Metropolitan Transport
mentioned format, it passes the Sender’s number, Corporation.
STARTINGPOINT and ENDINGPOINT to a Java SMS Short Message Service
program which processes the bus routes and sends TR Trunk Routes
an SMS back to the sender using redirecting URL’s FDR Feeder Routes
provided by the SMS gateway. The spell check JSP Java Server Pages
algorithms used here are more accurate than in web MMS Multimedia Messaging Service
tool implementation or the stand alone GSM Global System for Mobile
implementation and hence help us find the exact stop Communications
more precisely. The discussion of the spell check DBMS Database Management System
algorithms used here is beyond the scope of this DB Database
paper. SQL Structured Query Language

Conclusion References
India is a country of a billion people. This is one of [01] Bangalore Metropolitan Transport Corporation
the biggest economies in the world. As a matter of Official Website.
fact, the number of commuters by bus or any other http://www.bmtcinfo.com/
public transport system in India exceeds the numbers [02] Grid Plan Wikipedia, the free encyclopedia
of other developed and developing countries. This http://en.wikipedia.org/wiki/Grid_plan
country needs solutions for mass transport systems. [03] Short Message Service, Wikipedia the free
For bus transport systems, we have created prototype encyclopedia
server software for providing bus route information http://en.wikipedia.org/wiki/Short_message_service
to travel from point A to point B using Bus Services [04] Grid Square Map Definition-
within the city. The solution becomes highly useful thefreedictionary.com
when integrated with SMS services, because SMS http://www.thefreedictionary.com/grid+coordinate+s
has taken over the mobile market by a storm and the ystem
future of many services lies in mobile integration. [05] Grid Square Map Definition
The solution can be extended in many ways with http://en.mimi.hu/gis/grid.html
additional features and can be applied to similar [06] Minimum Bounding Rectangle- CLIM
problems such as car sharing, pooling, GPS tracking http://www.mikemac.com/mikemac/clim/bboxes.ht
etc. The next logical step would be build a robust, ml
high performance system that can serve the hapless [07] Metric- Wikipeida the free encyclopedia
commuters of any large city making their daily http://en.wikipedia.org/wiki/Metrics
experience more acceptable. [08] Wikipedia, free encyclopedia
http://en.wikipedia.org
[09] Soundex Algorithm Wikipedia
Acknowledgement http://en.wikipedia.org/wiki/soundex
I would like to thank my friend Anush Shetty, (CS [10] Metaphone Spelling Algorithm Wikipedia
8th Semester PESIT), for introducing me to the http://en.wikipedia.org/wiki/Metaphone
problem. I would also like to thank Mr Bhosekar, [11] Creating GUI with JFC Swing
(Former Division Controller Of BMTC), for giving http://java.sun.com/docs/books/tutorial/uiswing/
me insight into the grid system and BMTC for [12] Screem Scraping Wikipedia
providing me with the bus route information of http://en.wikipedia.org/wiki/Screen_scraping
[13] NowSMS SMS/MMS Gateway
Bangalore city. I would also like to thank Mr.R
www.nowsms.com/
Vekat Varadhan (Senior Architect, Hewlett Packard) [14] MySQL OpenSource DBMS
for helping me with coding techniques and tips. www.mysql.com/
Lastly and most importantly, I would like to thank [15] Dijkstra’s Algorithm
late.Bhanu Bhaskar ( Professor, PESIT) and Dr.
 Picture 4 – BMTC’s Route Map Of Bangalore
Courtesy: BMTC and Integra Systems
(Black Mark Over A Stop means that there is no Information about the Stop in the database’)
Screen Shots Using Swing Interface

Screen Shot 1- Login Screen

Screen Shot 2 – Bus Stop Information

Screen Shot 3 – Selecting the Start and End Bus Stops

Screen Shot 4 – Resulting Routes Information