UCSY's Research Repository

Finding Possible Transit-Routes in Hypergraph Yangon Bus Network

Show simple item record

dc.contributor.author Hlaing, Wai Mar
dc.date.accessioned 2020-12-17T14:30:36Z
dc.date.available 2020-12-17T14:30:36Z
dc.date.issued 2020-12
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/2537
dc.description.abstract Finding different possible ways in Public Bus Transportation System are essential for users. Most systems implement to search one shortest route for advising the user. Sometimes, the shortest route is not the best for users because they want to choose the desired route depend on the current condition. Transportation is a main sector for a country. The people in Yangon mainly rely on bus, taxi and private cars. Travelling in train is not popular in Yangon Region because it cannot reach to any place within the Yangon area. The system develops for two networks: Road network and Public bus network. Road network is developed for Yangon downtown area and Bus network is applied for Public transportation system. In Yangon downtown network, junction points of the road are assigned as nodes. Latha, Lanmadaw, Pabeldan, Kyauktada, Pazundaung and Botahtaung townships are contained Yangon downtown among of the 33 townships in Yangon. Simulated graph for Yangon downtown network is implemented using Java 2 Standard Edition (J2SE) technology. When the user enters start and destination points, two shortest results are described on the graph. For public bus transportation network, there are 33 townships coverage in Yangon and it contains about 2000 bus stops and many connections over 84 bus lines type and these are stored in oracle database. Keyword search technique can be used for inserting start bus stop and end bus stop. In addition, two Languages: Myanmar and English can be used for optimal routes finding. Client Server architecture is used for public transportation network. Java 2 Enterprise Edition (J2EE) Tomcat server and Android studio is used for implementing the public bus system. When the user enters start and end points, the system checks these points and then it searches the shortest and possible routes using proposed heuristic based search named Combine Forward and Backward Heuristic Search (CFBHS) algorithm. Each Route can be viewed on Google Map using Google Map Application Interface (API). Furthermore, the system also supports the bus numbers for each route. For unfamiliar users about Yangon Region, the system uses location-based alarm technique to get the alarm message when the destination is reached. According to the experimental results, proposed CFBHS algorithm is faster than Bi-directional Dijkstra and Popular heuristic search algorithm A*. Moreover, the proposed algorithm can produce not only the shortest but also the possible paths while A* can give one shortest result. en_US
dc.publisher University of Computer Studies, Yangon en_US
dc.title Finding Possible Transit-Routes in Hypergraph Yangon Bus Network en_US
dc.type Thesis en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


My Account