Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Lagos-Puertas, Andres Felipe"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    Item
    Propuesta para la implementación de un modelo de ruteo de buses escolares para la comunidad agustiniana de la jornada nocturna de la Uniagustiniana.
    Lagos-Puertas, Andres Felipe; Rodríguez Vázquez, William Camilo
    The mobility of the students of the night shift from the Uniagustiniana to their homes is affected due to the low frequency of the public transport system, which causes prolonged times in waiting for a bus that carried out the mobilization service, generating in turn exposure to external risks such as attempted theft or exposure to extreme climates such as cold or rain. Due to this problem, it is intended to prepare a proposal for the implementation of school routes that mobilize the Augustinian community from Uniagustiniana to the vicinity of their homes, determining the reliability of the respective service through surveys that will be carried out on a population sample, additionally allowing establish the points of the homes of those who are interested in acquiring this service and where the school route must pass. It is intended to design routes through the data obtained from the surveys by means of a mathematical model of vehicle routing applied to school buses, known as OCVRP (Open Capacitated Vehicle Routing Problem) using two Heuristics as solution methods, one is the algorithm sweep and the other is the closest neighbor algorithm. With the application of these Heuristics, it is intended to find a feasible route, seeking a lower cost and saving distances in the mobilization, complying with established parameters such as vehicle capacity and non-return to the distribution center.

DSpace software copyright © 2002-2025 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback

Tecnología DSpace implementada por