نقش پردازش موازی در تخصیص پویای حمل‌ونقل همگانی شهری با محدودیت ظرفیت

-Bell, M., (2003), "Capacity Constrained Transit Assignment Models and Reliability Analysis", In: Advanced Modeling for Transit Operations and Service Planning. Publication Of: Elsevier Science Publishers BV.

-Cats, O., & Glück, S., (2019), "Frequency And Vehicle Capacity Determination Using A Dynamic Transit Assignment Model", Transportation Research Record, 2673(3), pp.574-585.

-Chriqui, C., & Robillard, P., (1975), "Common Bus Lines, Transportation Science", 9(2), Pp.115-121.

-Cooke, K. L., & Halsey, E., (1966), "The Shortest Route Through A Network With Time-Dependent Internodal Transit Times", Journal of Mathematical Analysis and Applications, 14(3), pp.493-498.

-De Cea, J., & Fernández, E., (1993), "Transit Assignment for Congested Public Transport Systems: an Equilibrium Model", Transportation Science, 27(2), pp.133-147.

-Dixit, M., Cats, O., Brands, T., Van Oort, N., & Hoogendoorn, S., (2021), "Perception of Overlap In Multi-Modal Urban Transit Route Choice", Transportmetrica A: Transport Science, pp.1-23.

-Hamdouch, Y., & Lawphongpanich, S. (2008), "Schedule-Based Transit Assignment Model With Travel Strategies and Capacity Constraints", Transportation Research Part B: Methodological, 42(7-8),pp.663-684.

-Hamdouch, Y., Marcotte, P., & Nguyen, S., (2004), "Capacitated Transit Assignment With Loading Priorities", Mathematical Programming, 101(1), pp.205-230.

-Jansson, K., & Ridderstolpe, B., (1992),
"A Method for the Route-Choice Problem in Public Transport Systems", Transportation Science, 26(3), pp.246-251.

-Khani, A., (2013), "Models and Solution Algorithms For Transit and Intermodal Passenger Assignment (Development of Fast-Trips Model)", The University of Arizona.

-Khani, A., Hickman, M., & Noh, H., (2015), "Trip-Based Path Algorithms Using The Transit Network Hierarchy", Networks and Spatial Economics, 15(3), pp.635-653.

-Khani, A., Sall, E., Zorn, L., & Hickman, M., (2013), "Integration of The FAST-Trips Person-Based Dynamic Transit Assignment Model, The SF-CHAMP Regional, Activity-Based Travel Demand Model", and San Francisco’s Citywide Dynamic Traffic Assignment Model. Retrieved From

-Koh, K., Ng, C., Pan, D., & Mak, K. S., (2018), "Dynamic Bus Routing: A Study on The Viability of On-Demand High-Capacity Ridesharing As an Alternative to Fixed-Route Buses in Singapore", Paper Presented At The 2018 21^st International Conference on Intelligent Transportation Systems (ITSC).

-Kurauchi, F., Bell, M. G., & Schmöcker, J. D., (2003), "Capacity Constrained Transit Assignment With Common Lines", Journal Of Mathematical Modelling and Algorithms, 2(4), pp.309-327.

-Last, A., & Keak, S., (1976), "Transept: A Bus Model. Traffic Engineering & Control", 17(1).

-Levin, B. M., & Hedetniemi, S., (1963), "Determining Fastest Routes Using Fixed Schedules", Paper Presented at The Proceedings of The May, Spring Joint Computer Conference,

23. 21-23.

-Narayan, J., Cats, O., Van Oort, N., & Hoogendoorn, S., (2020), "Integrated Route Choice And Assignment Model for Fixed and Flexible Public Transport Systems", Transportation Research Part C: Emerging Technologies, 115, 102631.

-Nguyen, S., & Pallottino, S., (1989), "Hyperpaths and Shortest Hyperpaths", in Combinatorial Optimization, Springer,
pp. 258-271.

-Nguyen, S., Pallottino, S., & Gendreau, M., (1998), "Implicit enumeration of hyperpaths in a logit model for transit networks", Transportation science, 32(1), pp.54-64.

-Nguyen, S., Pallottino, S., & Malucelli, F., (2001), "A modeling framework for passenger assignment on a transport network with timetables", Transportation science, 35(3), pp.238-249.

-Nielsen, O. A., & Jovicic, G., (1999), "A large scale stochastic timetable-based transit assignment model for route and sub-mode choices", Ptrc-Publications-P, pp.169-184.

-Schmöcker, J.-D., Bell, M. G., & Kurauchi, F. (2008), "A quasi-dynamic capacity constrained frequency-based transit assignment model", Transportation Research Part B: Methodological, 42(10), pp.925-945.

-Spiess, H., & Florian, M., (1989), "Optimal strategies: a new assignment model for transit networks", Transportation Research Part B: Methodological, 23(2), pp.83-102.

-Tong, C., & Richardson, A., (1984), "A computer model for finding the time‐dependent minimum path in a transit system with fixed schedules", Journal of Advanced Transportation, 18(2), pp.145-161.

-Wahba, M., & Shalaby, A., (2009), "Learning-based departure time and path choice modelling for transit assignment under information provision: a theoretical framework", Paper presented at the 12^th international conference on travel behaviour research, Jaipur, Rajasthan, India.

-Zhou, X., Mahmassani, H. S., & Zhang, K., (2008), "Dynamic micro-assignment modeling approach for integrated multimodal urban corridor management", Transportation Research Part C: Emerging Technologies, 16(2), pp.167-186.