Metaheuristic methods for the urban transit routing problem

Doctoral thesis English OPEN
Fan, Lang
  • Subject: QA75
  • References (21)
    21 references, page 1 of 3

    4.1.2 Initialization 4.1.3 Feasibility Check 4.1.4 Make-Small-Change Framework of Implementing HC and SAAlgorithms Experim ental Results 4.3.1 Assessment Parameters 4.3.2 Weighting Parameters for the Objective Function 4.3.3 Results for Mandl's Swiss Transit Network 4.3.4 Scalability Experiments Summary

    [10] B. Yu, Z.Z. Yang, C. Cheng and C. Liu. Optimization bus transit network with parallel ant colony algorithm. Proceedings of the Eastern Asia Society fo r Transportation Studies, 5:374-389, 2005.

    [11] M.H. Baaj and H.S. Mahmassani. Trust: a lisp program for the analysis of tran sit route configurations. Transportation Research Record, 1283:125-135, 1990.

    [12] M.H. Baaj and H.S. Mahmassani. An Al-based approach for transit route system planning and design. Journal of Advance Transportation, 25(2):187-210, 1991.

    [18] M.R. Bussieck. Optimal lines in public rail transport. Ph.D. Thesis, TU Braunschweig, 1998.

    [19] A. Ceder and H.M. Wilson. Bus network design. Transportation Research, 20B(4):331-344, 1986.

    on Parallel, Distributed and Network-based Processing, Canary Islands, Spain, pages 376-383, 2002.

    [27] A.A. Dayem. Optimizing bus transfer coordination. Technique Report, International Institute for Geo-information Science and Earth Observation, Enschede, Netherlands, 2005.

    [28] K. Deb. Multi-objective optimization using evolutionary algorithms. Chichester, New York: John Wiley and Sons, 2001.

    [36] L. Fan and C.L. Mumford. A metaheuristic approach to the urban transit routing problem. Journal of Heuristics, ISSN 1381-1231 (Print) 1572-9397 (Online), published by Springer Online, 2008.

  • Metrics
    No metrics available
Share - Bookmark