Skip to main content
Log in

A computational tool for optimizing the urban public transport: A real application

  • Systems Analysis and Operations Research
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

In this work, we have conducted a study to evaluate and improve the performance of an urban transportation system. Specifically, we have designed an algorithm for obtaining new routes and assigning buses to these routes. The objective is to optimize the service level, measured as the sum of the time the passengers have to wait at the bus stops plus the duration of their journey. As a result, a user-friendly computational tool has been designed, which is currently used by the Burgos City Council. The tool has an attractive graphic interface and is flexible, allowing modifications in the input data. The solutions yielded by the system show an improvement of almost 10% in the service level. The work includes an analysis to identify which set of stops could be “repositioned” to improve even more the service level.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Handbook of Applied Optimization, Ed. by P. M. Pardalos and M. G. Resende (University Press, Oxford, 2002).

    MATH  Google Scholar 

  2. I. Litvinchev and V. Tsurkov, Aggregation in Large-scale Optimization, Springer, Berlin, 2003).

    MATH  Google Scholar 

  3. I. Litvinchev and S. Rangel, “Comparing Aggregated Generalized Transportation Models Using Error Bounds,” Ann. Oper. Res. 146, 119–134 (2006).

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Álvarez, O. Chacon, I. S. Litvinchev, and S. Rangel, “Aggregation in the Generalized Transportation Problem,” Izv. Ross. Akad. Nauk, Teor. Sist. Upr., No. 6, (2001) [Comp. Syst. Sci. 39 (6), 923–929 (2001)].

  5. K. W. Axhausen and R. L. Smith, “Evaluation of Heuristic Transit Network Optimization Algorithms,” Transportation Research Record 976, 7–20 (1984).

    Google Scholar 

  6. Y. Israeli and A. Ceder, “Transit Route Design Using Scheduling and Multiobjective Programming Techniques,” Computer-Aided Transit Scheduling, 56–75 (1993).

  7. M. H. Baaj and H. Mahmassani, “An AI-Based Approach for Transit Route System Planning and Design,” J. Advanced Transportation 25, 187–210 (1991).

    Article  Google Scholar 

  8. M. H. Baaj and H. Mahmassani, “TRUST: A LISP Program for the Analysis of Transit Route Configurations,” Transportation Research Record 1283, 125–135 (1992).

    Google Scholar 

  9. A. Ceder and Y. Israeli, “User and Operator Perspectives in Transit Network Design,” Transportation Research Record 1623, 3–7 (1998).

    Article  Google Scholar 

  10. W. Lampkin and P. D. Saalmans, “The Design of Routes, Service Frequencies and Schedules for a Municipal Bus Undertaking: A Case Study,” Operations Research 18, 375–397 (1967).

    Article  Google Scholar 

  11. W. Keudel, “Computer-Aided Line Network Design (DIANA) and Minimization of Transfer Times in Networks (FABIAN),” Lecture Notes in Economics and Mathematical Sciences 308, 16–28 (1988).

    Google Scholar 

  12. R. Borndorfer, M. Grostchel, and E. Pfestsch, “A Column-Generation Approach to Line Planning in Public Transport,” Transportation Science 41, 123–132 (2007).

    Article  Google Scholar 

  13. W. Fan and R. B. Machemehl, “Optimal Transit Route Network Design Problem with Variable Transit Demand: Genetic Algorithm Approach,” J. Transportation Engineering-ASCE 132, 40–51 (2006).

    Article  Google Scholar 

  14. W. Fan and R. B. Machemehl, “Using a Simulated Annealing Algorithm to Solve the Transit Route Network Design Problem,” J. Transportation Engineering-ASCE 132, 122–132 (2006).

    Article  Google Scholar 

  15. P. Chakroborty, “Genetic Algorithms for Optimal Urban Transport Design,” Computer Aided Civil and Infrastructure Engineering 18, 184–200 (2003).

    Article  Google Scholar 

  16. P. Borne, B. Fayech, S. Hammadi, and S. Maouche, “Decision Support System for Urban Transportation Networks,” IEEE Trans. Syst., Man Cybern. C 33, 67–77.

  17. G. Bruno and G. Laporte, “An Interactive Decision Support System for the Design of Rapid Public Transit Networks,” INFOR 40, 111–118 (2002).

    Google Scholar 

  18. B. Golden, L. Bodin, T. Doyle, and W. Stewart, Jr., “Approximate Travelling Salesman Algorithms,” Oper. Res. 38, 649–711 (1980).

    MathSciNet  Google Scholar 

  19. I. Or, Travelling Salesman Type Combinatorial Problems and Their Relations to the Logistics of Blood Banking, Ph.D. dissertation, Dept. Ind. Eng. Manag. Sci., Northwestern Univ (1976).

  20. E. Taillard, P. Badeau, M. Gendreu, et al., “A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows,” Transportation Sci. 3, 170–186.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © A. Álvarez, S. Casado, J.L. González Velarde, J. Pacheco, 2010, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2010, No. 2, pp. 78–86.

The article is published in the original.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Álvarez, A., Casado, S., González Velarde, J.L. et al. A computational tool for optimizing the urban public transport: A real application. J. Comput. Syst. Sci. Int. 49, 244–252 (2010). https://doi.org/10.1134/S1064230710020103

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230710020103

Keywords

Navigation