A Bounded Formulation for The School Bus Scheduling Problem

References

• Banerjee D, Smilowitz K (2019) Incorporating equity into the school bus scheduling problem. Transp. Res., Part E Logist. Trans. Rev. 131:228–246.Crossref, Google Scholar
• Banerjee S, Hssaine C, Périvier N, Samaranayake S (2021) Real-time approximate routing for smart transit systems. Preprint, submitted March 10, https://arxiv.org/abs/2103.06212.Google Scholar
• Bertsimas D, Delarue A, Martin S (2019) Optimizing schools’ start time and bus routes. Proc. Natl. Acad. Sci. USA 116(13):5943–5948.Crossref, Google Scholar
• Bidwell A (2015) Report: Federal education funding plummeting. www.usnews.com/news/blogs/data-mine/2015/06/24/report-federal-education-funding-cut-by-5-times-more-than-all-spending.Google Scholar
• Campbell JF, North JW, Ellegood WA (2015) Modeling Mixed Load School Bus Routing. Quantitative Approaches in Logistics and Supply Chain Management (Springer), 3–30.Crossref, Google Scholar
• Carraresi P, Gallo G (1984) Network models for vehicle and crew scheduling. Eur. J. Oper. Res. 16(2):139–151.Crossref, Google Scholar
• Chen X, Kong Y, Dang L, Hou Y, Ye X (2015) Exact and metaheuristic approaches for a bi-objective school bus scheduling problem. PLoS One. 10(7).Google Scholar
• Chernoff H (1952) A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist. 23:493–507.Crossref, Google Scholar
• De La Vega WF, Lueker GS (1981) Bin packing can be solved within 1+ ε in linear time. Combinatorica. 1(4):349–355.Crossref, Google Scholar
• Desrosiers J, de Montréal Centre de recherche sur les transports U, de Montréal Département d’informatique et de recherche opérationnelle U (1980) An Overview of School Busing System (Montréal: Université de Montréal, Centre de recherche sur les transports).Google Scholar
• Desrosiers J, Ferland JA, Rousseau JM, Lapalme G, Chapleau L(1986) Transcol: A multi-period school bus routing and scheduling system. Management Sci. 22:47–71.Google Scholar
• Dyer ME, Wolsey LA (1990) Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26(2–3):255–270.Crossref, Google Scholar
• Ellegood WA, Campbell JF, North J (2015) Continuous approximation models for mixed load school bus routing. Transportation Res. Part B: Methodological 77:182–198.Crossref, Google Scholar
• Fügenschuh A (2009) Solving a school bus scheduling problem with integer programming. European J. Oper. Res. 193(3):867–884.Crossref, Google Scholar
• Garey MR, Johnson DS (2002) Computers and Intractability, vol. 29(W. H. Freeman, New York).Google Scholar
• Gavish B, Schweitzer P, Shlifer E (1978) Assigning buses to schedules in a metropolitan area. Comput. Oper. Res. 5(2):129–138.Crossref, Google Scholar
• Ikura Y, Gimple M (1986) Efficient scheduling algorithms for a single batch processing machine. Oper. Res. Lett. 5(2):61–65.Crossref, Google Scholar
• Keller I, Tompkins C (1956) An extension of a theorem of Dantzig’s. linear inequalities and related systems. Ann. Math. Stud. 38:247–254.Google Scholar
• Kim BI, Kim S, Park J (2012) A school bus scheduling problem. Eur. J. Oper. Res. 218(2):577–585.Crossref, Google Scholar
• Köksal Ahmed E, Li Z, Veeravalli B, Ren S (2020) Reinforcement learning-enabled genetic algorithm for school bus scheduling. J. Intelligent Transportation Syst., https://www.sciencedirect.com/org/science/article/abs/pii/S1547245022003619.Crossref, Google Scholar
• Lenstra JK, Shmoys DB, Tardos E (1990) Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(1–3):259–271.Crossref, Google Scholar
• Newton RM, Thomas WH (1969) Design of school bus routes by computer. Socio-Econom. Planning Sci. 3(1):75–85.Crossref, Google Scholar
• Olariu S (1991) An optimal greedy heuristic to color interval graphs. Inform. Process. Lett. 37(1):21–25.Crossref, Google Scholar
• Orloff CS (1976) Route constrained fleet scheduling. Transportation Sci. 10(2):149–168.Link, Google Scholar
• Park J, Kim BI (2010) The school bus routing problem: A review. Eur. J. Oper. Res. 202(2):311–319.Crossref, Google Scholar
• Park J, Tae H, Kim BI (2012) A post-improvement procedure for the mixed load school bus routing problem. Eur. J. Oper. Res. 217(1):204–213.Crossref, Google Scholar
• Queyranne M, Schulz AS (1994) Polyhedral Approaches to Machine Scheduling (TU, Fachbereich 3, Berlin).Google Scholar
• Scholl A, Klein R, Jürgens C (1997) Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput. Oper. Res. 24(7):627–645.Crossref, Google Scholar
• Schulz AS (1996) Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. Internat. Conf. Integer Programming Combinatorial Optimization, 301–315 (Springer).Google Scholar
• Shmoys DB, Tardos É (1993) An approximation algorithm for the generalized assignment problem. Math. Programming 62(1–3):461–474.Crossref, Google Scholar
• Sousa JP, Wolsey LA (1992) A time indexed formulation of non-preemptive single machine scheduling problems. Math. Programming 54(1):353–367.Crossref, Google Scholar
• Spada M, Bierlaire M, Liebling TM (2005) Decision-aiding methodology for the school bus routing and scheduling problem. Transportation Sci. 39(4):477–490.Link, Google Scholar
• Swersey AJ, Ballard W (1984) Scheduling school buses. Management Sci. 30(7):844–853.Link, Google Scholar
• Wang F, Xu Y (2011) Estimating O–D travel time matrix by Google Maps API: implementation, advantages, and implications. Ann. GIS. 17(4):199–209.Crossref, Google Scholar
• Wenzel C (2016) Optimale schulanfangszeiten zur entlastung des nahverkehrs in der stadt nürnberg. Angewandte Mathematik und Optimierung Schriftenreihe (AMOS).Google Scholar
• Zeng L, Chopra S, Smilowitz K (2019) The covering path problem on a grid. Transportation Sci. 53(6):1656–1672.Link, Google Scholar