Intelligent agent optimization of urban bus transit system design

Journal of Computing in Civil Engineering

Volumn 25, Issue 5, 2011, Pages 357-369

  Blum, Jeremy J ^a   Mathew, Tom V ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Optimization; Public transportation; Routing; Transportation networks

Indexed keywords

BUS NETWORKS; BUS ROUTE; BUS SYSTEMS; COMMERCIAL APPLICATIONS; DELHI , INDIA; INTELLIGENT AGENT ARCHITECTURE; INTELLIGENT AGENT SYSTEM; LOGISTICS PROBLEMS; META-HEURISTIC APPROACH; NEAR-OPTIMAL SOLUTIONS; OPTIMAL SOLUTIONS; OPTIMIZATION SYSTEM; PUBLIC TRANSPORTATION; RESEARCH STUDIES; ROUTING; TRANSIT OPERATORS; TRANSIT ROUTE NETWORKS; TRANSIT SYSTEMS; TRANSPORTATION NETWORKS; URBAN BUS;

BUS TRANSPORTATION; BUSES; HEURISTIC METHODS; INTELLIGENT AGENTS; MASS TRANSPORTATION; NETWORK ARCHITECTURE; OPTIMAL SYSTEMS; SYSTEMS ANALYSIS; TRANSPORTATION ROUTES;

OPTIMIZATION;

EID: 80052805519     PISSN: 08873801     EISSN: None     Source Type: Journal    
DOI: 10.1061/(ASCE)CP.1943-5487.0000095     Document Type: Article

References (32)

1. Agrawal, J., and Mathew, T. V. (2004). Parallel GA for transit route network design. J. Comput. Civ. Eng. JCCEE5 0887-3801, 18 (3), 248-256. 10.1061/(ASCE)0887-3801(2004)18:3(248) (Pubitemid 40475421)
2. Baaj, M. H., and Mahmassani, H. S. (1995). Hybrid route generation heuristic algorithm for the design of transit networks. Transp. Res. Part C 0968-090X, 3 (1), 31-50. 10.1016/0968-090X(94)00011-S
3. Barbucha, D., and Jedrzejowicz, P. (2008). Multi-agent platform for solving the dynamic vehicle routing problem. Proc. IEEE Intelligent Transportation System Conf., IEEE, New York, 517-522.
4. Bielli, M., Caramia, M., and Carotenuto, P. (2002). Genetic algorithms in bus network optimization. Transp. Res. Part C 0968-090X, 10 (1), 19-34. 10.1016/S0968-090X(00)00048-6 (Pubitemid 33011660)
5. Blum, J., and Eskandarian, A. (2002). Enhancing intelligent agent collaboration for flow optimization of railroad traffic. Transp. Res. Part A Policy Pract. 0965-8564, 36 (10), 919-930. 10.1016/S0965-8564(02)00002-2 (Pubitemid 35400183)
6. Ceder, A., and Wilson, N. H. M. (1986). Bus network design. Transp. Res. Part B: Methodol. TRBMDY 0191-2615, 20 (4), 331-344. 10.1016/0191-2615(86)90047- 0 (Pubitemid 16637550)
7. Chien, S. I.-J., Dimitrijevic, B. V., and Spasovic, L. N. (2003). Optimization of bus route planning in urban commuter networks. J. Public Transp. 1077-291X, 6 (1), 53-80.
8. Chien, S., Yang, Z., and Hou, E. (2001). A genetic algorithm approach for transit route planning and design. J. Transp. Eng., 127 (3), 200-207. JTPEDI 0733-947X 10.1061/(ASCE)0733-947X(2001)127:3(200) (Pubitemid 32434848)
9. de Souza, P. (1993). Asynchronous organizations for multi-algorithm problems. Ph.D. thesis, Dept. of Computer Science, Carnegie Mellon Univ., Pittsburgh.
10. Dubois, D., Bel, G., and Llibre, M. (1979). Set of methods in transportation network synthesis and analysis. J. Oper. Res. Soc., 30 (9), 797-808. JORSDZ (Pubitemid 10415209)
11. Fan, W., and Machemehl, R. (2004 a). A tabu search based heuristic method for the transit route network design problem. Proc. Int. Conf. on Computer-Aided Scheduling of Public Transport, Institute for Operations Research and Management Sciences (INFORMS), College Station, TX.
12. Fan, W., and Machemehl, R. B. (2004 b). Optimal transit route network design problem: Algorithms. Texas Transportation Institute Report No. SWUTC/04/167244-1, Southwest Region Univ. Transportation Center, College Station, TX.
13. Fan, W., and Machemehl, R. B. (2006 a). Optimal transit route network design problem with variable transit demand: Genetic algorithm approach. J. Transp. Eng., 132 (1), 40-51. JTPEDI 0733-947X 10.1061/(ASCE)0733-947X(2006)132: 1(40) (Pubitemid 43124787)
14. Fan, W., and Machemehl, R. B. (2006 b). Using a simulated annealing algorithm to solve the transit route network design problem. J. Transp. Eng., 132 (2), 122-132. JTPEDI 0733-947X 10.1061/(ASCE)0733-947X(2006)132:2(122) (Pubitemid 43119042)
15. Jaszkiewicz, A. (2004). On the computational efficiency of multiple objective metaheuristics: The knapsack problem case study. Eur. J. Oper. Res., 158 (2), 418-433. EJORDT 0377-2217 10.1016/j.ejor.2003.06.015
16. Kao, J. H., Hemmerle, J. S., and Prinz, F. B. (1996). Collision avoidance using asynchronous teams. Proc. IEEE Int. Conf. on Robotics and Automation, IEEE, New York.
17. Kuah, G. K., and Perl, J. (1988). Optimization of feeder bus routes and bus-stop spacing. J. Transp. Eng., 114 (3), 341-354. JTPEDI 0733-947X 10.1061/(ASCE)0733-947X(1988)114:3(341) (Pubitemid 18606000)
18. Lei, D., and Yan, X. (2007). Urban transit route network design problem using tabu search algorithm. Proc. Int. Conf. on Transportation Engineering, 3929-3934.
19. Lui, H., and Yang, X. (2007). Bus transit route network design using genetic algorithm. Proc. Int. Conf. on Transportation Engineering, ASCE, Reston, VA 10.1061/40932(246)187.
20. Mandl, C. E. (1980). Evaluation and optimization of urban public transportation networks. Eur. J. Oper. Res., 5 (6), 396-404. EJORDT 0377-2217 10.1016/0377-2217(80)90126-5 (Pubitemid 11454509)
21. Marwah, B. R., Parti, R., and Kalra, P. K. (2005). Optimal planning of transit routes for large cities. Proc. Conf. on Automated People Movers: Moving to Mainstream, ASCE, Reston, VA.
22. Newell, G. F. (1979). Some issues relating to the optimal design of bus routes. Transp. Sci. TRSCBJ 0041-1655, 13 (1), 20-35. 10.1287/trsc.13.1.20 (Pubitemid 9459137)
23. Ngamchai, S., and Lovell, D. J. (2003). Optimal time transfer in bus transit route network design using a genetic algorithm. J. Transp. Eng., 129 (5), 510-521. JTPEDI 0733-947X 10.1061/(ASCE)0733-947X(2003)129:5(510) (Pubitemid 37164328)
24. Pattnaik, S. B., Mohan, S., and Tom, V. M. (1998). Urban bus transit route network design using genetic algorithms. J. Transp. Eng., 124 (4), 368-375. JTPEDI 0733-947X 10.1061/(ASCE)0733-947X(1998)124:4(368) (Pubitemid 28392716)
25. Shih, M.-C., Mahmassani, H. S., and Baaj, M. H. (1998). Planning and design model for transit route networks with coordinated operations. Transportation Research Record 1623, Transportation Research Board, Washington, DC, 16-23.
26. Silman, L. A., Barzily, Z., and Passy, U. (1974). Planning the route system for urban buses. Comput. Oper. Res., 1 (2), 201-211. CMORAP 0305-0548 10.1016/0305-0548(74)90046-X
27. Talukdar, S., Baerentzen, L., Gove, A., and De Souza, P. (1998). Asynchronous teams: Cooperation schemes for autonomous agents. J. Heuristics 1381-1231, 4 (4), 295-321. 10.1023/A:1009669824615 (Pubitemid 128514318)
28. Tom, V. M. (1999). Urban transit route network design using genetic algorithm. Ph.D. thesis, Dept. of Civil Engineering, Indian Institute of Technology, Madras, India.
29. Tsen, C. K. (1995). Solving train scheduling problems using A-teams. Ph.D. thesis, Dept. of Computer Science, Carnegie Mellon Univ., Pittsburgh.
30. Yu, B., Yang, Z., Cheng, C., and Liu, C. (2005). Optimizing bus transit network with parallel ant colony algorithm. Proc. Eastern Asia Society for Transportation Studies, Association for Planning Transportation Studies, Tokyo, 5, 374-389.
31. Zhao, F., and Ubaka, I. (2004). Transit network optimization: Minimizing transfers and optimizing route directness. J. Public Transp. 1077-291X, 7 (1), 63-81.
32. Zhao, F., and Zeng, X. (2006). Simulated annealing-genetic algorithm for transit network optimization. J. Comput. Civ. Eng., 20 (1), 57-68. JCCEE5 0887-3801 10.1061/(ASCE)0887-3801(2006)20:1(57)