04/11/23 1

Bus Route Advisory Algorithms and Services

Akshaya SrivatsaDepartment of Telecommunication EngineeringPESITakshay.s86@gmail.com

04/11/23 2

Agenda

Case Study-BMTC Problem Statement Solution Objectives System Architecture The Algorithm The Services Strengths And Limitations Next Steps Acknowledgement

04/11/23 3

Case Study-BMTC

Bangalore city has Over 1700 bus routes Over 1100 bus stops 16 trunk routes and 14

more to be added Currently, highly

disoriented bus routes

BMTC- Bangalore Metropolitan Transport Corporation

04/11/23 4

Problem Statement

Current ScenarioCurrent Scenario Large number of bus stops and Large number of bus stops and

bus routesbus routes Difficulty in identifying good Difficulty in identifying good

routesroutes Public’s ignorance about the Public’s ignorance about the

entire bus route systementire bus route system The bus stops are not equipped The bus stops are not equipped

with dynamic display boardswith dynamic display boards Long waiting time in bus stops Long waiting time in bus stops

due to lack of information on due to lack of information on timingtiming

04/11/23 5

Solution Objectives

To design a software, that To design a software, that

suggest routes between any two stops, after optimizing on suggest routes between any two stops, after optimizing on time and distancetime and distance

is accessible through is accessible through Internet – users can browse from their desktopsInternet – users can browse from their desktops Mobile phone - low priced Short Message Service [SMS], Mobile phone - low priced Short Message Service [SMS],

enables this service to be made available on mobile phonesenables this service to be made available on mobile phones

04/11/23 6

Solution Objectives - Continued

Is highly user friendly and intuitive The users need to provide,

Starting bus stop name. Ending bus stop name.

Is capable of generating Direct bus routes One interchange bus routes Grid bus routes -The future of bus services

Trunk Routes Feeder Routes

04/11/23 7

System Architecture

Commuters

Get bus route1

2 Optimized bus routes

Get bus route SMS1

2 Optimized bus routes SMS

NOW SMS/MMS gateway

Internet Tomcat,

MySQL,

Windows 2000

04/11/23 8

A Prototype Implementation

A prototype software has been developed with both the internet and mobile phone access to get the bus route information

The software is developed using Java

A web application is based on Java server pages (JSP) and is deployed on Tomcat – J2EE servlet container

The backend database used for storing the bus route information is MySQL

An SMS implementation has also been developed using Now SMS/MMS gateway trial edition and Sony Ericsson mobile phone as the GSM modem

Metaphone and Soundex algorithms for spell check have been used.

04/11/23 9

The Algorithms

Requirements The following parameters are essential for the algorithm

Bus route length Total time of journey Timings of departure from the bus stations Stops the route visits Interchange points

In the case study of BMTC, we screen scraped some sample bus routes and built the database.

04/11/23 10

The Algorithms- ContinuedDirect Bus RoutesDirect Bus Routes

• These routes are the simplest to find.• Direct bus routes need not always provide time or money optimization.

So routes which do not provide any of the optimizations need to be “Filtered” out.

AlgorithmAlgorithm

• Identify all routes that contain the starting bus stops name and ending bus stops name

• Ensure that the bus routes do not exceed a “Threshold” distance/time value

04/11/23 11

The Algorithms-Continued

S tar in g S to pI n ter c h an g e

P o in tE n d in g S to p

One Interchange Routes

• Routes that need one change of bus.

• Interchange points-These are typically stops where multiple routes intersect.

04/11/23 12

The Algorithms- Continued

Algorithm

The bounding rectangleThe bounding rectangle The interchange pointsThe interchange points The estimation metricThe estimation metric Identifying routes with best Identifying routes with best

metricmetric Final constraints on the Final constraints on the

routesroutes

S ta rt

Ide ntify A ll T he Inte rc ha ng eP o ints W ithin T he B o unding

R e c ta ng le

C ho o s e A N e wInte rc ha ng e P o int

Ar e The r eB use s F r o m

A to I j?

Ar e The r eB use s F r o m

I j T o B ?

C a lc ula te T he M e tric F o r " A toI j" a nd F o r " I j T o B " . A dd B o th

T he M e tric s a nd N a m e It A s" M e tric j" .

H ave Al lThe I j B e e nE x h au s te d ?

A rra n g e Th e In terch a n g eP o in ts In D ecrea s in g

O rd er O f M etric

D is pla y T he T o p3 R e s uls

S to p

Y E S

Y E S

Y E S

N O

N O

N O

04/11/23 13

Strength of the solution

Solves route identification issues faced by people who use the metropolitan bus service. Very few cities offer this service across the world.

Computationally simple The entire control lies in the estimation metric. Designed for Grid based services - The future of metropolitan bus

services A generic algorithm – can be used with vehicles equipped with GPS

systems, taxi routing etc

04/11/23 14

Limitations of the solution

Scalability – Cannot be scaled for ‘n’ interchange situations where n >= 2

Averaged out data – Not a good approach in solving a real world problem

Soundex and Metaphone – Not the best spell check algorithms

04/11/23 15

Results

The algorithm is able to generate a fairly accurate bus routes. There is a good match between the routes suggested by the

algorithm and routes actually taken by experienced bus commuters.

Results obtained are better than the ones suggested by the BMTC site.

Sometimes, the algorithm does not provide any “One interchange routes” if the existing bus system is not well designed.

Sample ResultSample Result----Will add my programs output here-------Will add my programs output here---

04/11/23 16

Next Steps

Use of real time data, such as traffic congestion, time of arrival of the buses, in the algorithm

Using the algorithm along with GPS services Redesigning and testing the algorithm for grid based services Making use of location services (Example-BMTC Yeliddiri

service) Using maps for displaying results

04/11/23 17

Acknowledgement

I would like to thank the following people who have guided I would like to thank the following people who have guided me through this workme through this work

Dr.Bhanubhaskar and Dr. H N Shankar, Professors, PESITDr.Bhanubhaskar and Dr. H N Shankar, Professors, PESIT Mr. Bhosekar, Former Divisional Controller of BMTCMr. Bhosekar, Former Divisional Controller of BMTC Mr. Srivatsa Krishnaswamy, Director of technology and innovation, Mr. Srivatsa Krishnaswamy, Director of technology and innovation,

Perot Systems, Mr. Venkat Varadhan and Mrs. Lakshmi Kutty, senior Perot Systems, Mr. Venkat Varadhan and Mrs. Lakshmi Kutty, senior architects, Hewlett Packardarchitects, Hewlett Packard

Mr.Anush Shetty, 8Mr.Anush Shetty, 8thth semester Computer Science, PESIT semester Computer Science, PESIT