References
- Borndörfer, R., A. Löbel, and S. Weider. 2008. “A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit.” Lecture Notes in Economics and Mathematical Systems600: 3–24.
- Bruglieri, Maurizio, Diego Ciccarelli, Alberto Colorni, and Alessandro Luè. 2011. “PoliUniPool: A Carpooling System for Universities.” Procedia—Social and Behavioral Sciences 20: 558–567.
- Caprara, A., P. Toth, D. Vigo, and M. Fischetti. 1998. “Modeling and Solving the Crew Rostering Problem.” Operations Research 46 (6): 820–830.
- Ceder, A. 2007. Public Transit Planning and Operation: Theory, Modeling and Practice. Oxford, UK: Elsevier.
- Desrochers, M., and F. Soumis. 1989. “A Column Generation Approach to the Urban Transit Crew Scheduling Problem.” Transportation Science 23 (1): 1–13.
- Eilam-Tzoreff, T. 1998. “The Disjoint Shortest Paths Problem.” Discrete Applied Mathematics 85 (2): 113–138.
- Esclapés, Carmen. 2000. “Asignación de Conductores a Jornadas de Trabajo en Empresas de Transporte Colectivo.” PhD diss., Universitat Politecnica de Catalunya, Spain.
- Fortune, S., J. Hopcroft, and J. Wyllie. 1980. “The Directed Subgraph Homeomorphism Problem.” Theoretical Computer Science 10 (2): 111–121.
- Freling, R., D. Huisman, and A. P. M. Wagelmans. 2003. “Models and Algorithms for Integration of Vehicle and Crew Scheduling.” Journal of Scheduling 6 (1): 63–85.
- Guo, L. 2014. “Improved LP-Rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem.” Lecture Notes in Computer Science (including the subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) LNCS 8497: 94–104. doi:10.1007/978-3-319-08016-1_9.
- Hsieh, Fu-Shiung. 2020. “A Comparative Study of Several Metaheuristic Algorithms to Optimize Monetary Incentive in Ridesharing Systems.” ISPRS International Journal of Geo-Information 9 (10): 590.
- Hsieh, Fu-Shiung, Fu-Min Zhan, and Yi-Hong Guo. 2019. “A Solution Methodology for Carpooling Systems Based on Double Auctions and Cooperative Coevolutionary Particle Swarms.” Applied Intelligence 49 (2): 741–763.
- Huisman, D., R. Freling, and A. P. M. Wagelmans. 2005. “Multiple-Depot Integrated Vehicle and Crew Scheduling.” Transportation Science 39 (4): 491–502.
- Ibarra-Rojas, O. J., F. Delgado, R. Giesen, and J. C. Muñoz. 2015. “Planning, Operation, and Control of Bus Transport Systems: A Literature Review.” Transportation Research Part B: Methodological 77: 38–75.
- IBM. 2016. “IBM ILOG CPLEX Optimization Studio OPL Language User's Manual”.
- Karp, R. M. 1975. “On the Complexity of Combinatorial Problems.” Networks 5 (2): 45–68.
- Kleehammer, Michael. 2016. “IBM.” https://ibmdecisionoptimization.github.io/docplex-doc/mp/docplex.mp.model.html#docplex.mp.model.Model.add_mip_start.
- Kleehammer, Michael. 2020. “Pyodbc.” https://github.com/mkleehammer/pyodbc/wiki.
- Kliewer, Natalia, Bastian Amberg, and Boris Amberg. 2012. “Multiple Depot Vehicle and Crew Scheduling with Time Windows for Scheduled Trips.” Public Transport 3 (3): 213–244. doi:10.1007/s12469-011-0049-6.
- Kliewer, N., T. Mellouli, and L. Suhl. 2006. “A Time Space Network Based Exact Optimization Model for Multi-Depot Bus Scheduling.” European Journal of Operational Research 175 (3): 1616–1627.
- Li, Hong, Ying Wang, Shi Li, and Sujian Li. 2015. “A Column Generation Based Hyper-Heuristic to the Bus Driver Scheduling Problem.” Discrete Dynamics in Nature and Society 2015: Article ID 638104. doi:10.1155/2015/638104.
- Maniezzo, Vittorio, Antonella Carbonaro, and Hanno Hildmann. 2004. “An Ants Heuristic for the Long-term Car Pooling Problem.” In New Optimization Techniques in Engineering, 411–430. Berlin: Springer. doi:10.1007/978-3-540-39930-8_15.
- Mauri, G. R., and L. A. N. Lorena. 2007. “A New Hybrid Heuristic for Driver Scheduling.” International Journal of Hybrid Intelligent Systems 4 (1): 39–47.
- McKinney, Wes. 2011. “pandas: A Foundational Python Library for Data Analysis and Statistics.” Python for High Performance and Scientific Computing 14 (9). https://www.researchgate.net/publication/265194455_pandas_a_Foundational_Python_Library_for_Data_Analysis_and_Statistics.
- Peña, David, Andrei Tchernykh, Bernabé Dorronsoro, and Patricia Ruiz. 2022. “A Novel Multi-Objective Optimization Approach to Guarantee Quality of Service and Energy Efficiency in a Heterogeneous Bus Fleet System.” Engineering Optimization. 17pp. Advance online publication. doi:10.1080/0305215X.2022.2055007.
- Savelsbergh, Martin. 1997. “A branch-and-price algorithm for the generalized assignment problem.” Operations Research 45 (6): 831–841. INFORMS.
- Schöbel, A. 2012. “Line Planning in Public Transportation: Models and Methods.” OR Spectrum 34 (3): 491–510.
- Sherali, H. D., K. Ozbay, and S. Subramanian. 1998. “The Time-Dependent Shortest Pair of Disjoint Paths Problem: Complexity, Models, and Algorithms.” Networks 31 (4): 259–272.
- Smith, B. M., and A. Wren. 1988. “A Bus Crew Scheduling System Using a Set Covering Formulation.” Transportation Research Part A: General 22 (2): 97–108.
- Steinzen, I., V. Gintner, L. Suhl, and N. Kliewer. 2010. “A Time–Space Network Approach for the Integrated Vehicle- and Crew-Scheduling Problem with Multiple Depots.” Transportation Science 44 (3): 367–382. doi:10.1287/trsc.1090.0304.
- Sun, D. J., Y. Xu, and Z.-R. Peng. 2015. “Timetable Optimization for Single Bus Line Based on Hybrid Vehicle Size Model.” Journal of Traffic and Transportation Engineering 2 (3): 179–186.
- Wren, A., S. Fores, A. Kwan, R. Kwan, M. Parker, and L. Proll. 2003. “A Flexible System for Scheduling Drivers.” Journal of Scheduling 6 (5): 437–455.
- Yu, B., Z. Yang, and J. Yao. 2009. “Genetic Algorithm for Bus Frequency Optimization.” Journal of Transportation Engineering 136 (6): 576–583. doi:10.1061/(ASCE)TE.1943-5436.0000119.
- Yunes, T. H., A. V. Moura, and C. C. de Souza. 2005. “Hybrid Column Generation Approaches for Urban Transit Crew Management Problems.” Transportation Science 39 (2): 273–288.