1 / 18

Optimal Routes for Travelling between Government Universities in Bangkok

Optimal Routes for Travelling between Government Universities in Bangkok. Optimal Routes for Travelling between Government Universities in Bangkok. by. 1. Miss Ampai Kaewgrajang 2. Mr. Chukiat Cheerakunkit 3. Miss Supaporn Sungkasuk 4. Dr. Elvin Moore 5. Dr. Utomporn Phalavonk.

nelson
Télécharger la présentation

Optimal Routes for Travelling between Government Universities in Bangkok

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Optimal Routes for Travelling between Government Universities in Bangkok

  2. Optimal Routes for Travelling between Government Universities in Bangkok by 1. Miss Ampai Kaewgrajang 2. Mr. Chukiat Cheerakunkit 3. Miss Supaporn Sungkasuk 4. Dr. Elvin Moore 5. Dr. Utomporn Phalavonk Department of Mathematics, Faculty of Applied Science King Mongkut’s Institute of Technology North Bangkok

  3. Organization of Presentation Statement of the Problem List of Government Universities in Bangkok Available Data Graph Theory Model Results Conclusions and Recommendations

  4. Statement of the Problem • Aims: • For each pair of government universities in Bangkok, find shortest distance routes, minimum time routes and minimum cost routes for both directions of travel in morning and evening peak periods. • Develop Visual Basic program for easy choice of optimal routes. • Method: Construct weighted digraph models for distance, time and cost for each direction of travel in morning and evening peak periods. Use Dijkstra’s algorithm to find minimum for each weighted digraph.

  5. Government Universities in Bangkok 1. Chulalongkorn University (CU) 2. Kasetsart University (KU) 3. King Mongkut’s Institute of Technology North Bangkok (KMITNB) 4. King Mongkut’s Institute of Technology Ladkrabang (KMITL) 5. King Mongkut’s University of Technology Thonburi (KMUTT) 6. Mahidol University (MU) 7. Ramkhamhang University (RU) 8. Silapakorn University (SU) 9. Srinakarintarawirot University (SWU) 10.Sukhotai Thammatirat University (STU) 11.Thammasat University (TU)

  6. Available Data • Road Map of Bangkok. Note: Distances depend on direction of travel due to one-way roads and divided highways. • Table of Average Speeds on Roads in Bangkok for In-bound and Out-bound traffic in Morning and Evening Peak Periods. • Official Table of Taxi Meter Rates in Bangkok

  7. Map of Bangkok

  8. Extract from Table of Average Speeds (km/hour) in The Peak Hours During Jan - Sept 2002

  9. Extract from Table of Taxi Fares * In case of traffic jam or the taxi can not move more than 6 km./hour passenger pays 1.25 baht / minute

  10. Graph Theory Model Selection of Possible Routes Example of Distance Digraph. Example of Time Digraph Using Ramkamhang U & Chulalongkorn U as an example

  11. มหาวิทยาลัยรามคำแหง จุฬาลงกรณ์มหาวิทยาลัย Possible routes from RU (right) to CU (left)

  12. a a(1,0) 1.6 8.1 h b 1.4 0.9 b(2,1.6) 7.2 g c 1.6 f c(3,2.5) 2.9 0.6 7.0 e d d(4,5.4) a(1,0) g(5,9.7) b(2,1.6) c(3,2.5) f(6,11.3) b) Final tree Shortest distance is 11.3 km a) Tree after 4 iterations d(4,5.4) Weighted Distance (km.) Digraph for Routes from Ramkhamhang University to Chulalongkorn University Trees constructed by Dijkstra Algorithm

  13. a a(1,0) a(1,0) 5.9 15.1 b(2,5.9) b(2,5.9) h b 10.4 3.2 c(3,9.1) c(3,9.1) h(5,21.0) h(5,21.0) 33.7 g c 2.5 f 10.7 g(6,31.4) a) Tree after 5 iterations 2.5 20.8 d(4,19.7) d(4,19.7) e d b) Final tree. Minimum time is 33.9 min. f(7,33.9) Weighted Morning Time (minute) Digraph for Routes from Ramkhamhang University to Chulalongkorn University

  14. a(1,0) a b(2,3.6) 3.6 21.9 c(3,5.5) h b h(5,25.4) 12.6 1.9 43.0 g c 3.1 d(4,11.9) f 6.4 g(6,4) 3.1 30.2 e d f(7,41.1) a(1,0) b) Final tree. Minimum time is 41.1 min b(2,3.6) c(3,5.5) h(5,25.4) a) Tree after 5 iterations d(4,11.9) Weighted Evening Time (minute) Digraph for Routes from Ramkhamhang University to Chulalongkorn University

  15. Results Optimal Routes in Morning Peak Optimal Routes in Evening Peak Computer Program (In Thai) (Uses Visual Basic & Microsoft Access) Not shown in this presentation.

  16. Optimal Routes in Morning Peak From Ramkhamhang University to Other Government Universities

  17. Optimal Routes in Evening Peak From Ramkhamhang University to Other Government Universities

  18. Conclusions and Recommendations Graph Theory is a good way to find optimal routes Limitations * Published data is limited * Travel costs depend on type of transport * There can be big variations in travel times for different days Recommendation * The travel time must be considered as important part when designing class timetables at universities offering joint courses with other universities. * Other forms of transport should be considered for further study

More Related