Public Transport Route Finding using a Hybrid Genetic Algorithm

Article English OPEN
Liviu Adrian COTFAS ; Andreea DIOSTEANU (2011)
  • Publisher: Inforec Association
  • Journal: Informatică economică, volume 15, issue 1, pages 62-68 (issn: 1453-1305, eissn: 1842-8088)
  • Subject: Computer engineering. Computer hardware | Hybrid Genetic Algorithm | Route Finding | Evolutionary Algorithms | Z | Route Finding, Evolutionary Algorithms, Hybrid Genetic Algorithm | TK7885-7895 | Bibliography. Library science. Information resources

In this paper we present a public transport route finding solution based on a hybrid genetic algorithm. The algorithm uses two heuristics that take into consideration the number of trans-fers and the remaining distance to the destination station in order to improve the convergence speed. The interface of the system uses the latest web technologies to offer both portability and advanced functionality. The approach has been evaluated using the data for the Bucharest public transport network.
  • References (9)

    [1] E. Dijkstra, "A note on two problems in connexion with graphs," Numerische mathematik, vol. 1, 1959, p. 269-271.

    [2] A. Piwonska and J. Koszelew, “Evolutionary Algorithms Find Routes in Public Transport Network with Optimal Time of Realization,” Transport Systems Telematics, 2011, p. 194-201.

    [3] C. Jun, “Route Selection in Public Trans- al Report No. 3756-95. Cambridge, Masport Network Using GA,” in Proc. Esri sachusettes Institute of Tehnology, Sloan User Conference, School of Management (1995). /library/userconf/ [10] Oracle, "Java Me," 2011. [Online]. proc05/papers/pap1874.pdf. Available:

    [4] C.H. Lin, J.L. Yu, J.C. Liu, C.J. Lee, technetwork/java/javame/overview/. “Genetic Algorithm for Shortest Driving [Accessed: January. 15, 2010]. Time in Intelligent Transportation Sys- [11] W3C, "Web SQL Database," 2011. tems,” in Proc. of the 2008 International [Online]. Available: Conference on Multimedia and Ubiquit- TR/webdatabase/.[Accessed: January. 15, ous Engineering, pp. 402-406, 2008. 2010].

    [5] C. Lin, J. Yu, J. Liu, and C. Lee, "Genetic [12] W3C, "Web Storage," 2011. [Online]. Algorithm for Shortest Driving Time in Available: websIntelligent Transportation Systems," torage/. [Accessed: January. 15, 2010]. 2008, pp. 402-406. [13] W3C, "HTML5," 2011. [Online]. Avail-

    [6] S.H. Jung, “Queen-bee evolution for ge- able: Overnetic algorithms,” Electronics Letters, view.html. [Accessed: January. 15, 2010]. vol. 39, 2003, p. 575-576. [14] W3C, "Indexed Database API," 2011.

    [7] L.J. Eshelman and J.D. Schaffer, “Pre- [Online]. Available: venting Premature Convergence in Ge- [Acnetic Algorithms by Preventing Incest,” cessed: January. 15, 2010]. ICGA, R.K. Belew and L.B. Booker, eds., [15] W3C, "Geolocation API," 2011. [OnMorgan Kaufmann, 1991, pp. 115-122. line]. Available:

    [8] A. Konak, D. Coit, and A. Smith, “Multi- geolocation-API/. [Accessed: January. 15, objective optimization using genetic algo- 2010]. rithms: A tutorial,” Reliability Engineering & System Safety, vol. 91, Sep. 2006, pp. 992-1007.

    [9] H.M. Safer, J.B. Orlin, “Fast approximation schemas for multicriterial combinatorial optimization”, Tehnic-

  • Metrics
    No metrics available
Share - Bookmark