SciELO - Scientific Electronic Library Online

 
vol.26 issue45DeSoftln: A methodological proposal for individual software development author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Revista Facultad de Ingeniería

Print version ISSN 0121-1129

Abstract

OSPINA-TORO, Daniela; TORO-OCAMPO, Eliana Mirledy  and  GALLEGO-RENDON, Ramón Alfonso. A methodology for creating Feeding routes in mass transit systems. Rev. Fac. ing. [online]. 2017, vol.26, n.45, pp.9-21. ISSN 0121-1129.  http://dx.doi.org/10.19053/01211129.v26.n45.2017.6052.

This paper proposes a methodology to identify feeding routes for areas disconnected to the Mass Transit System (MTS), in order to propose an alternative solution to the deficit in the number of carried passengers. The proposed methodology consists of two steps: (1) structuring scenarios for areas disconnected from the transport system, and (2) combining heuristic and exact techniques to solve the feeding routes problem. The methodology considers among its restrictions the path length and the passenger vehicle capacity. To model the problem, a comparison with the Location Routing Problem (LRP), which is usually applied to freight transport problems, was established. The proposed methodology is a math-heuristic that combines the Lin-Kernighan-Helsgaun algorithm (LKH), and the Clark and Wright's Savings heuristic with the Branch-and-Cut exact algorithm, which is applied into a Mixed Integer Linear Programming model (MILP), also known as a Set Partitioning model (SP) for LRP. This methodological approach is validated with real instances in the massive transport system of Pereira (Megabús), considering some areas disconnected from the Central-Occidental Metropolitan Area System (AMCO) of Pereira, located in the Colombia's Coffee Axis.

Keywords : Feeding Routes; LKH algorithm; Location Routing Problem; Math-Heuristic; Savings Algorithm; Set-Partitioning model.

        · abstract in Spanish | Portuguese     · text in English     · English ( pdf )