Solving a discrete multimodal transportation network design problem

Transportation Research Part C: Emerging Technologies

Volumn 49, Issue , 2014, Pages 73-86

  Zhang, Lihui ^a   Yang, Hai ^b   Wu, Di ^c   Wang, Dianhai ^a  

^a ZHEJIANG UNIVERSITY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

Active set algorithm; Bus route layout; Multimodal network design; Multimodal user equilibrium; Road capacity expansion

Indexed keywords

BUS TRANSPORTATION; EXPANSION; MULTIMODAL TRANSPORTATION;

ACTIVE-SET ALGORITHMS; BUS ROUTE; MULTIMODAL NETWORK; ROAD CAPACITY; USER EQUILIBRIUM;

BUSES;

ALGORITHM; BUS TRANSPORT; NETWORK DESIGN; NUMERICAL MODEL; OPTIMIZATION; TRANSPORTATION MODE; TRANSPORTATION PLANNING;

EID: 84910641740     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2014.10.008     Document Type: Article

References (45)

1. Aghassi M., Bertsimas D., Perakis G. Solving asymmetric variational inequalities via convex optimization. Oper. Res. Lett. 2006, 34:481-490.
2. Ahuja R., Magnanti T., Orlin J. Network Flows: Theory, Algorithms, and Applications 1993, The Prentice-Hall Inc., Saddle River, NJ.
3. Artigues C., Huguet M., Gueye F., Schettini F., Dezou L. State-based accelerations and bidirectional search for bi-objective multi-modal shortest paths. Transp. Res., Part C 2013, 27:233-259.
4. Baaj M.H., Mahmassani H.S. An AI-based approach for transit route system planning and design. J. Adv. Transp. 1991, 25:187-210.
5. Bagloee A.S., Ceder A. Transit-network design methodology for actual-size road networks. Transp. Res., Part B 2011, 45:1787-1804.
6. Bellei G., Gentile G., Papola N. Network pricing optimization in multi-user and multimodal context with elastic demand. Transp. Res., Part B 2002, 36:779-798.
7. Borndörfer R., Grötschel M., Pfetsch M.E. A column-generation approach to line planning in public transport. Transp. Sci. 2007, 41:123-132.
8. Bouhana A., Fekih A., Abed M., Chabchoub H. An integrated case-based reasoning approach for personalized itinerary search in multimodal transportation systems. Transp. Res., Part C 2013, 31:30-50.
9. Brooke, A., Kendrick, D., Meeraus, A., Raman R., 2005. GAMS: A User's Guide. GAMS Development Corporation, Washington, D.C.
10. Cipriani E., Gori S., Petrelli M. Transit network design: A procedure and an application to a large urban area. Transp. Res., Part C 2012, 20:3-14.
11. Fan W., Machemehl R. Using a simulated annealing algorithm to solve the transit route network design problem. J. Transp. Eng. 2006, 132:122-132.
12. Fletterman, M., 2008. Designing Multimodal Public Transport Networks Using Metaheuristics. Master Thesis, University of Pretoria.
13. Gallo, M., D'acierno, L., Montella, B., 2010. Model and algorithms for solving the multimodal network design problem in regional contexts. In: Proceedings of the 12th World Conference on Transport Research, Lisbon, Portugal.
14. Gao Z., Wu J., Sun H. Solution algorithm for the bi-level discrete network design problem. Transp. Res., Part B 2005, 39:479-495.
15. Gentile G., Papola N., Persia L. Advanced pricing and rationing policies for large scale multimodal networks. Transp. Res., Part A 2005, 39:612-631.
16. Guihaire V., Hao J.K. Transit network design and scheduling: A global review. Transp. Res., Part A 2008, 42:1251-1273.
17. Kepaptsoglou K., Karlaftis M. Transit route network design problem: Review. J. Transp. Eng. 2009, 135:491-505.
18. Lam W.H.K., Gao Z.Y., Chan K.S., Yang H. A stochastic user equilibrium assignment model for a congested transit networks. Transp. Res., Part B 1999, 33:351-368.
19. LeBlanc L.J. An algorithm for the discrete network design problem. Transp. Sci. 1975, 9:183-199.
20. Li C., Yang H., Zhu D., Meng Q. A global optimization method for continuous network design problems. Transp. Res., Part B 2012, 46:1144-1158.
21. Luathep P., Sumalee A., Lam W.H.K., Li Z.C., Lo H.K. Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach. Transp. Res., Part B 2011, 45:808-827.
22. Mauttone A., Urquhart M.E. A route set construction algorithm for the transit network design problem. Comput. Oper. Res. 2009, 36:2440-2449.
23. Meng Q., Yang H., Bell M.G.H. An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transp. Res., Part B 2001, 35:83-105.
24. Munizaga M.A., Palma C. Estimation of a disaggregate multimodal public transport Origin-Destination matrix from passive smartcard data from Santiago, Chile. Transp. Res., Part C 2012, 24:9-18.
25. Nayeem M.A., Rahman M.K., Rahman M.S. Transit network design by genetic algorithm with elitism. Transp. Res., Part C 2014, 46:30-45.
26. Nuzzolo A., Crisalli U., Rosati L. A schedule-based assignment model with explicit capacity constraints for congested transit networks. Transp. Res., Part C 2012, 20:16-33.
27. Parbo J., Nielsen O.A., Prato C.G. User perspectives in public transport timetable optimization. Transp. Res., Part C 2014, 48:269-284.
28. Uchida K., Sumalee A., Watling D., Connors R. A study on network design problems for multi-modal networks by probit-based stochastic user equilibrium. Network Spatial Econ. 2007, 7:213-240.
29. Wan Q.K., Lo H.K. A mixed integer formulation for multiple-route transit network design. J. Math. Modell. Algorithms 2003, 2:299-308.
30. Wan Q.K., Lo H.K. Congested multimodal transit network design. Publ. Transp. 2009, 1:233-251.
31. Wang G., Gao Z., Xu M., Sun H. Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints. Comput. Oper. Res. 2014, 41:252-261.
32. Wang D.W.Z., Lo H.K. Global optimum of the linearized network design problem with equilibrium flows. Transp. Res., Part B 2010, 44:482-492.
33. Wang S., Meng Q., Yang H. Global optimization methods for the discrete network design problem. Transp. Res., Part B 2013, 50:42-60.
34. Wu Z.X., Lam W.H.K., Chan K.S. Multimodal network design: Selection of pedestrianisation location. J. Eastern Asia Soc. Transp. Stud. 2005, 6:2275-2290.
35. Wu D., Yin Y., Lawphongpanich S. Pareto-improving congestion pricing on multimodal transportation networks. Eur. J. Oper. Res. 2011, 210:660-669.
36. Yang H. Sensitivity analysis for the elastic demand network equilibrium problem with applications. Transp. Res., Part B 1997, 31:55-70.
37. Yang H., Bell M.G.H. Models and algorithms for road network design: A review and some new developments. Transp. Rev. 1998, 18:257-278.
38. Yang H., Huang H.J. Mathematical and Economic Theory of Road Pricing 2005, Elsevier, Kidlington, Oxford, UK.
39. Yang Z., Yu B., Cheng C. A parallel ant colony algorithm for bus network optimization. Comput. Aided Civil Environ. Eng. 2007, 22:44-55.
40. Yao B., Hu P., Lu X., Gao J., Zhang M. Transit network design based on travel time reliability. Transp. Res., Part C 2014, 43:233-248.
41. Ying J., Yang H. Sensitivity analysis of stochastic user equilibrium flows in a bi-modal network with application to optimal pricing. Transp. Res., Part B 2005, 39:769-795.
42. Yu B., Yang Z., Jin P., Wu S., Yao B. Transit route network design-maximizing direct and transfer demand density. Transp. Res., Part C 2012, 22:58-75.
43. th International Symposium on Transportation and Traffic Theory 2009, 283-300. Springer. W.H.K. Lam, S.C. Wong, H.K. Lo (Eds.).
44. Zhang L., Sun J. A dual-based heuristic for optimal cordon pricing design. J. Transp. Eng. 2013, 139:1105-1116.
45. Zhao F., Zeng X. Optimization of transit route network, vehicle headways and timetables for large-scale transit networks. Eur. J. Oper. Res. 2008, 186:841-855.