Loading...
Please wait, while we are loading the content...
Similar Documents
Obtención del tiempo más corto para el problema de transporte en el sistema local de transporte público peruano 'El Metropolitano'
| Content Provider | Semantic Scholar |
|---|---|
| Author | Nolasco, Juan José Martínez Atoche, Wilmer |
| Copyright Year | 2013 |
| Abstract | This document is written up in order to provide the best routes or alternatives concerning the time taken from an origin to a chosen destination. The case study is focus on the Peruvian’s transport systems. For this particularly case study, the transport’s route name ‘El Metropolitano’, which is responsible for transporting people from Lima Centro (Main Bus Station) towards Lima South (Matellini). In order to achieve this goal, our study is based on the Dijkstra’s algorithm, which implies to define several factors such as distance travelled, time taken, total number of stops, direction of the route, among others. This document is divided into 3 main sections. The first section provides an overview of how does the local transport in Peru works, and how does ‘El Metropolitano’ deals to offer a solution for minimize the time taken in moving from a origin to a chosen destination. It also, describes how Dijkstra’s algorithm works for solving transport problems and why does it apply for the chosen case study. The second section shows the procedure and the results obtained according to the data collected. Finally, the third section portrays the observations and conclusion based on the results obtained |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.laccei.org/LACCEI2014-Guayaquil/RefereedPapers/RP146.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
