Tabu search strategies for the public transportation network optimizations with variable transit demand

Computer-Aided Civil and Infrastructure Engineering

Volumn 23, Issue 7, 2008, Pages 502-520

  Fan, Wei ^a   Machemehl, Randy B ^b  

^a UNIVERSITY OF TEXAS AT TYLER   (United States)

^b The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGLOMERATION; BENCHMARKING; BUSES; ELECTRIC NETWORK ANALYSIS; GENETIC ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; HEURISTIC PROGRAMMING; MASS TRANSPORTATION; ROUTING ALGORITHMS; SENSITIVITY ANALYSIS; SET THEORY; TRANSPORTATION; TRANSPORTATION ROUTES;

CANDIDATE SOLUTION; COMPREHENSIVE TESTING; GENERATION PROCESS; INDUSTRY GUIDELINES; MIXED INTEGERS; MULTI OBJECTIVES; NETWORK ANALYSIS; NUMERICA L RESULTS; PERFORMANCE MEASURES; PUBLIC TRANSPORTATION NETWORKS; PUBLIC TRANSPORTATIONS; SEARCH STRATEGIES; SOLUTION SPACES; TABU SEARCH (TS); TABU SEARCH METHODS; TRANSIT DEMAND; TRANSIT ROUTE NETWORK; VARIABLE DEMAND;

TABU SEARCH;

BUS TRANSPORT; NETWORK ANALYSIS; NETWORK DESIGN; NUMERICAL MODEL; OPTIMIZATION; PUBLIC TRANSPORT; SENSITIVITY ANALYSIS; TRAVEL DEMAND;

EID: 50249137168     PISSN: 10939687     EISSN: 14678667     Source Type: Journal    
DOI: 10.1111/j.1467-8667.2008.00556.x     Document Type: Article

References (36)

1. Ahuja, R. K., Magnanti, T. L. & Orlin, J. B. (1993), Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ.
2. Baaj, M. H. & Mahmassani, H. S. (1990), TRUST: A Lisp Program for the Analysis of Transit Route Configuration, Transportation Research Record 1283, Transportation Research Board, Washington, DC, pp. 125-35.
3. Baaj, M. H. & Mahmassani, H. S. (1991), An AI-based approach for transit route system planning and design, Journal of Advanced Transportation, 25 (2), 187-210.
4. Baaj, M. H. & Mahmassani, H. S. (1992), Artificial Intelligence-Based System Representation and Search Procedures for Transit Route Network Design, Transportation Research Record 1358, Transportation Research Board, Washington, DC, pp. 67-70.
5. Ben-Akiva, M. & Lerman, S. (1985), Discrete Choice Analysis: Theory and Application to Travel Demand, MIT Press, Cambridge, MA.
6. Ceder, A. & Wilson, N. H. (1986), Bus network design, Transportation Research, 20B (4), 331-44.
7. Ceder, A. & Israeli, Y. (1998), User and operator perspective in transit network design, Paper No. 980267, The 77th Annual Meeting of TRB, Washington, DC.
8. Ceder, A., Gonzalez, O. & Gonzalez, H. (2002), Design of Bus Routes: Methodology and the Santo Domingo Case, Transportation Research Record No. 1791, Transportation Research Board, Washington, DC.
9. Cevallos, F. & Zhao, F. (2006), Minimizing Transfer Times in Public Transit Network with Genetic Algorithm, Transportation Research Record No. 1971, Transportation Research Board, Washington, DC, pp. 74-9.
10. Chakroborty, P. & Dwivedi, T. (2002), Optimal route network design for transit systems using genetic algorithms, Engineering Optimization, 34 (1), 83-100.
11. Chien S., Yang, Z. & Hou, E. (2001), A genetic algorithm approach for transit route planning and design, Journal of Transportation Engineering, ASCE, 127 (3), 200-7.
12. Cordeau, J.-F. & Laporte, G. (2003), A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research. Part B: Methodological, 37 (6), 579-94.
13. Dubois, D., Bell, G. & Llibre, M. (1979), A set of methods in transportation network synthesis and analysis, Journal of Operations Research Society, 30, 797-808.
14. Fan, W. (2004), Optimal transit route network design problem: algorithms, implementations, and numerical results, Ph.D. dissertation, The University of Texas at Austin, Austin, TX.
15. Fan, W. & Machemehl, R. B. (2004), A tabu search based heuristic method for the transit route network design problem, in Proceedings of the 2004 Conference on Computer-Aided Scheduling of Public Transport (CASPT), San Diego, CA, August 9-11, 2004.
16. Fan, W. & Machemehl, R. B. (2006a), Optimal transit route network design problem with variable transit demand: A genetic algorithm approach, Journal of Transportation Engineering, 132 (1), 1-12.
17. Fan, W. & Machemehl, R. B. (2006b), Using a simulated annealing algorithm to solve the transit route network design problem, Journal of Transportation Engineering, 132 (2), 1-11.
18. Glover, F. (1977), Heuristics for integer programming using surrogate constraints, Decision Sciences, 8 (1), 156-66.
19. Glover, F. (1986), Future paths for integer programming and links to artificial intelligence, Computers and Operations Research, 5, 533-49.
20. Glover, F. (1989), Tabu search, part I, ORSA Journal on Computing, 1, 190-206.
21. Glover, F. (1990), Tabu search, part II, ORSA Journal on Computing, 2, 4-32.
22. Glover, F. & Laguna, M. (1997), Tabu Search, Kluwer Academic Publishers, Norwell, MA.
23. Han, A. F. & Wilson, N. (1982), The allocation of buses in heavily utilized networks with overlapping routes, Transportation Research, 16B, 221-32.
24. Jerby, S. & Ceder, A. (2006), Optimal Routing Design for Shuttle Bus Service, Transportation Research Record No. 1971, Transportation Research Board, Washington, DC.
25. Lampkin, W. & Saalmans, P. D. (1967), The design of routes, service frequencies and schedules for a municipal bus undertaking: A case study, Operation Research Quarterly, 18, 375-97.
26. LeBlanc, L. J. (1988), Transit system network design, Transportation Research B, 22B (5), 383-90.
27. Lee, Y. J. & Vuchic, V. R. (2005), Transit network design with variable demand, Journal of Transportation Engineering, 131 (1), 2005.
28. NCHRP Synthesis of Highway Practice 69. (1980), Bus Route and Schedule Planning Guidelines, Transportation Research Board, National Research Council, Washington, DC.
29. Newell, G. F. (1979), Some issues relating to the optimal design of bus routes, Transportation Science, 13 (1), 20-35.
30. Pattnaik, S. B., Mohan, S. & Tom, V. M. (1998), Urban bus transit network design using genetic algorithm, Journal of Transportation Engineering, 124 (4), 368-75.
31. Shih, M., Mahmassani, H. S. & Baaj, M. (1998), Trip Assignment Model for Timed-Transfer Transit Systems, Transportation Research Record 1571, Transportation Research Board, Washington, DC, pp. 24-30.
32. Silman, L. A., Barzily, Z. & Passy, U. (1974), Planning the route system for urban buses, Computers and Operations Research, 1, 201-11.
33. Van Nes, R., Hamerslag, R. & Immer, B. H. (1988), The Design of Public Transport Networks, Transportation Research Record 1202, Transportation Research Board, Washington, DC, pp. 74-83.
34. Yen, J.Y. (1971), Finding the K shortest loopless paths in a network, Management Science, 17 (11), 712-6.
35. Zhao, F. (2006), Large-scale transit network optimization by minimizing user cost and transfers, Journal of Public Transportation, 9 (2), 107-29.
36. Zhao, F., Ubaka, I. & Gan, A. (2005), Transit network optimization: minimizing transfers and maximizing service coverage with an integrated simulated annealing and tabu search method, Transportation Research Record No. 1923, Transportation Research Board, pp. 180-8.