Mathematical programming formulations for transit network design

Transportation Research Part B: Methodological

Volumn 77, Issue , 2015, Pages 17-37

  Cancela, Héctor ^a   Mauttone, Antonio ^a   Urquhart, María E ^a  

^a UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

Author keywords

Bilevel programming; Mathematical programming; Optimal strategies; Public transportation; Transit network design

Indexed keywords

BUS TRANSPORTATION; BUSES; C (PROGRAMMING LANGUAGE); DESIGN; MASS TRANSPORTATION; MATHEMATICAL OPERATORS; MATHEMATICAL PROGRAMMING; TRANSPORTATION; TRANSPORTATION ROUTES;

BI-LEVEL PROGRAMMING; CAPACITY CONSTRAINTS; MATHEMATICAL FORMULATION; MIXED-INTEGER LINEAR PROGRAMMING; OPTIMAL STRATEGIES; PUBLIC TRANSPORTATION; PUBLIC TRANSPORTATION SYSTEMS; TRANSIT NETWORK DESIGN;

INTEGER PROGRAMMING;

BUS TRANSPORT; MATHEMATICAL ANALYSIS; MODEL TEST; NETWORK DESIGN; NUMERICAL MODEL; PLANNING METHOD; TRANSPORTATION INFRASTRUCTURE; TRANSPORTATION PLANNING; TRANSPORTATION SYSTEM;

EID: 84961620776     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2015.03.006     Document Type: Article

References (55)

1. Ahuja R., Magnanti T., Orlin J. Network Flows 1993, Prentice-Hall.
2. An, J., Teng, J., Meng, L., 2008. A BRT network route design model. In: 11th International IEEE Conference on Intelligent Transportation Systems, Beijing, China, pp. 734-741.
3. Baaj M.H., Mahmassani H.S. An AI-based approach for transit route system planning and design. Journal of Advanced Transportation 1991, 25(2):187-210.
4. Bagloee S., Ceder A. Transit-network design methodology for actual-size road networks. Transportation Research Part B 2011, 45(10):1787-1804.
5. Bard J. Practical Bilevel Optimization 1998, Kluwer.
6. Borndörfer R., Grötschel M., Pfetsch M. A column-generation approach to line planning in public transport. Transportation Science 2007, 41(1):123-132.
7. Bouzaïene-Ayari B., Gendreau M., Nguyen S. Modeling bus stops in transit networks: a survey and new formulations. Transportation Science 2001, 35(3):304-321.
8. Ceder A., Wilson N.H.M. Bus network design. Transportation Research Part B 1986, 20(4):331-344.
9. Cepeda M., Cominetti R., Florian M. A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria. Transportation Research Part B 2006, 40(6):437-459.
10. Chriqui C., Robillard P. Common bus lines. Transportation Science 1975, 9(2):115-121.
11. Cipriani E., Gori S., Petrelli M. Transit network design: a procedure and an application to a large urban area. Transportation Research Part C 2012, 20(1):3-14.
12. Colson B., Marcotte P., Savard G. An overview of bilevel optimization. Annals of Operations Research 2007, 153(1):235-256.
13. Constantin I., Florian M. Optimizing frequencies in a transit network: a nonlinear bi-level programming approach. International Transactions in Operational Research 1995, 2(2):149-164.
14. Correa J., Schulz A., Stier-Moses N. Selfish routing in capacitated networks. Mathematics of Operations Research 2004, 29(4):961-976.
15. de Cea J., Fernández E. Transit assignment to minimal routes: an efficient new algorithm. Traffic Engineering & Control 1989, 30(10):491-494.
16. de Cea J., Fernández E. Transit assignment for congested public transport systems: an equilibrium model. Transportation Science 1993, 27(2):133-147.
17. Desaulniers G., Hickman M.D. Public transit. Handbooks in Operations Research and Management Science 2007, vol. 14:69-127. Elsevier, Amsterdam. G. Laporte, C. Barnhart (Eds.).
18. Dial R. Transit pathfinder algorithm. Highway Research Record 1967, 205:67-85.
19. Farahani R., Miandoabchi E., Szeto W., Rashidi H. A review of urban transportation network design problems. European Journal of Operational Research 2013, 229(2):281-302.
20. Fernández J., Cea J.d., Malbran R. Demand responsive urban public transport system design: methodology and application. Transportation Research Part A 2008, 42(7):951-972.
21. Fortuny-Amat J., McCarl B. A representation and economic interpretation of a two-level programming problem. Journal of the Operational Research Society 1981, 32:783-792.
22. Gallo M., Montella B., D'Acierno L. The transit network design problem with elastic demand and internalisation of external costs: an application to rail frequency optimisation. Transportation Research Part C 2011, 19(6):1276-1305.
23. Gao Z., Sun H., Shan L.L. A continuous equilibrium network design model and algorithm for transit systems. Transportation Research Part B 2004, 38(3):235-250.
24. Gendreau, M., 1984. Etude approfondie d'un modèle d'équilibre pour l'affectation de passagers dans les réseaux de transports en commun. Ph.d. thesis, Universitde Montral. Publication CRT-384.
25. Guan J., Yang H., Wirasinghe S. Simultaneous optimization of transit line configuration and passenger line assignment. Transportation Research Part B 2006, 40(10):885-902.
26. Guihaire V., Hao J. Transit network design and scheduling: a global review. Transportation Research Part A 2008, 42(10):1251-1273.
27. Kepaptsoglou K., Karlaftis M. Transit route network design problem: review. Journal of Transportation Engineering 2009, 135(8):491-505.
28. Kiliç F., Gök M. A demand based route generation algorithm for public transit network design. Computers & Operations Research 2014, 51:21-29.
29. Larrain H., Muñoz J. Public transit corridor assignment assuming congestion due to passenger boarding and alighting. Networks and Spatial Economics 2008, 8(2-3):241-256.
30. Leiva C., Muñoz J., Giesen R., Larrain H. Design of limited-stop services for an urban bus corridor with capacity constraints. Transportation Research Part B 2010, 44(10):1186-1201.
31. Lownes N., Machemehl R. Exact and heuristic methods for public transit circulator design. Transportation Research Part B 2010, 44(2):309-318.
32. Magnanti T.L., Wong R.T. Network design and transportation planning: models and algorithms. Transportation Science 1984, 18(1):1-55.
33. Mandl C. Applied Network Optimization 1980, Academic Press.
34. Mauttone A., Urquhart M. A route set construction algorithm for the transit network design problem. Computers & Operations Research 2009, 36(8):2440-2449.
35. Mumford, C., 2013. New heuristic and evolutionary operators for the multi-objective urban transit routing problem. In: 2013 IEEE Congress on Evolutionary Computation.
36. Nguyen S., Pallottino S. Equilibrium traffic assignment for large scale transit networks. European Journal of Operational Research 1988, 37(2):176-186.
37. Nielsen O. A stochastic transit assignment model considering differences in passengers utility functions. Transportation Research Part B 2000, 34(5):377-402.
38. Nuzzolo A. Transit path choice and assignment model approaches. Advanced Modeling for Transit Operations and Service Planning 2003, 93-124. Elsevier, Oxford. W. Lam, M. Bell (Eds.).
39. Ortúzar J.d.D., Willumnsen L. Modelling Transport 1996, John Wiley and Sons.
40. Pattnaik S.B., Mohan S., Tom V.M. Urban bus transit route network design using genetic algorithm. Journal of Transportation Engineering 1998, 124(4):368-375.
41. Rao, K.V.K., Muralidhar, S., Dhingra, S.L., 2000. Public transport routing and scheduling using genetic algorithms. In: 8th International Conference on Computer Aided Scheduling of Public Transport, Berlin, Germany.
42. Schmid V. Hybrid large neighborhood search for the bus rapid transit route design problem. European Journal of Operational Research 2014, 238(2):427-437.
43. Schöbel A. Line planning in public transportation: models and methods. OR Spectrum 2012, 34(3):491-510.
44. Schöbel, A., Scholl, S., 2005. Line planning with minimal traveling time. In: Kroon, L., Möhring, R. (Eds.), 5th Workshop on Algorithmic Methods and Models for Optimization of Railways.
45. Silman L.A., Barziliy Z., Passy U. Planning the route system for urban buses. Computers & Operations Research 1974, 1(2):201-211.
46. Spiess H., Florian M. Optimal strategies: a new assignment model for transit networks. Transportation Research Part B 1989, 23(2):83-102.
47. Szeto W., Jiang Y. Transit route and frequency design: bi-level modeling and hybrid artificial bee colony algorithm approach. Transportation Research Part B 2014, 67:235-263.
48. Vicente L., Savard G., Judice J. Discrete linear bilevel programming problem. Journal of Optimization Theory and Applications 1996, 89(3):597-614.
49. Walteros J., Medaglia A., Riaño G. Hybrid algorithm for route design on bus rapid transit systems. Transportation Science 2015, 10.1287/trsc.2013.0478.
50. Wan Q.K., Lo H.K. A mixed integer formulation for multiple-route transit network design. Journal of Mathematical Modelling and Algorithms 2003, 2(4):299-308.
51. Wan Q., Lo H. Congested multimodal transit network design. Public Transport 2009, 1(3):233-251.
52. Yen J. Finding the k shortest loopless paths in a network. Management Science 1972, 17(11):712-716.
53. Yu B., Yang Z., Jin P., Wu S., Yao B. Transit route network design maximizing direct and transfer demand density. Transportation Research Part C 2012, 22:58-75.
54. Zhao J., Dessouky M. Service capacity design problems for mobility allowance shuttle transit systems. Transportation Research Part B 2008, 42:135-146.
55. Zhao F., Zeng X. Optimization of transit route network, vehicle headways and timetables for large-scale transit networks. European Journal of Operational Research 2008, 186:841-855.