IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v147y2006i1p199-21610.1007-s10479-006-0066-z.html
   My bibliography  Save this article

A multicriteria approach for optimizing bus schedules and school starting times

Author

Listed:
  • Armin Fügenschuh
  • Alexander Martin

Abstract

In many rural counties pupils on their way to school are a large, if not the largest group of customers for public mass transit. Hence an effective optimization of public mass transit in these regions must include the traffic caused by pupils. Besides a change in the schedules of the buses and the starting times of the trips, the school starting time may become an integral part of the planning process. We discuss the legal framework for this optimization problem in German states and counties and present a multi-objective mixed-integer linear programming formulation for the simultaneous specification of school and trip starting times. For its solution, we develop a two-stage decomposition heuristic and apply it to practical data sets from three different rural German counties. Copyright Springer Science + Business Media, LLC 2006

Suggested Citation

  • Armin Fügenschuh & Alexander Martin, 2006. "A multicriteria approach for optimizing bus schedules and school starting times," Annals of Operations Research, Springer, vol. 147(1), pages 199-216, October.
    • Handle: RePEc:spr:annopr:v:147:y:2006:i:1:p:199-216:10.1007/s10479-006-0066-z
    DOI: 10.1007/s10479-006-0066-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0066-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0066-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lawrence D. Bodin & Lon Berman, 1979. "Routing and Scheduling of School Buses by Computer," Transportation Science, INFORMS, vol. 13(2), pages 113-129, May.
    2. Ferland, Jacques A. & Fortin, Luc, 1989. "Vehicles scheduling with sliding time windows," European Journal of Operational Research, Elsevier, vol. 38(2), pages 213-226, January.
    3. Desaulniers, Guy & Lavigne, June & Soumis, Francois, 1998. "Multi-depot vehicle scheduling problems with time windows and waiting costs," European Journal of Operational Research, Elsevier, vol. 111(3), pages 479-494, December.
    4. Bowerman, Robert & Hall, Brent & Calamai, Paul, 1995. "A multi-objective optimization approach to urban school bus routing: Formulation and solution method," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(2), pages 107-123, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    2. Banerjee, Dipayan & Smilowitz, Karen, 2019. "Incorporating equity into the school bus scheduling problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 131(C), pages 228-246.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fügenschuh, Armin, 2009. "Solving a school bus scheduling problem with integer programming," European Journal of Operational Research, Elsevier, vol. 193(3), pages 867-884, March.
    2. Park, Junhyuk & Kim, Byung-In, 2010. "The school bus routing problem: A review," European Journal of Operational Research, Elsevier, vol. 202(2), pages 311-319, April.
    3. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    4. Hernan Caceres & Rajan Batta & Qing He, 2017. "School Bus Routing with Stochastic Demand and Duration Constraints," Transportation Science, INFORMS, vol. 51(4), pages 1349-1364, November.
    5. Ellegood, William A. & Solomon, Stanislaus & North, Jeremy & Campbell, James F., 2020. "School bus routing problem: Contemporary trends and research directions," Omega, Elsevier, vol. 95(C).
    6. Shangyao Yan & Fei-Yen Hsiao & Yi-Chun Chen, 2015. "Inter-School Bus Scheduling Under Stochastic Travel Times," Networks and Spatial Economics, Springer, vol. 15(4), pages 1049-1074, December.
    7. Schittekat, Patrick & Kinable, Joris & Sörensen, Kenneth & Sevaux, Marc & Spieksma, Frits & Springael, Johan, 2013. "A metaheuristic for the school bus routing problem with bus stop selection," European Journal of Operational Research, Elsevier, vol. 229(2), pages 518-528.
    8. Zolfagharinia, Hossein & Haughton, Michael, 2018. "The importance of considering non-linear layover and delay costs for local truckers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 331-355.
    9. C Alabas-Uslu, 2008. "A self-tuning heuristic for a multi-objective vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 988-996, July.
    10. Fátima M. Souza Lima & Davi S. D. Pereira & Samuel V. Conceição & Ricardo S. Camargo, 2017. "A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads," 4OR, Springer, vol. 15(4), pages 359-386, December.
    11. Kim, Byung-In & Kim, Seongbae & Park, Junhyuk, 2012. "A school bus scheduling problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 577-585.
    12. Chen, Xinwei & Wang, Tong & Thomas, Barrett W. & Ulmer, Marlin W., 2023. "Same-day delivery with fair customer service," European Journal of Operational Research, Elsevier, vol. 308(2), pages 738-751.
    13. Herminia I. Calvete & Carmen Galé & José A. Iranzo & Paolo Toth, 2020. "A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection," Mathematics, MDPI, vol. 8(8), pages 1-20, July.
    14. Bowerman, Robert & Hall, Brent & Calamai, Paul, 1995. "A multi-objective optimization approach to urban school bus routing: Formulation and solution method," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(2), pages 107-123, March.
    15. Ahmed Hadjar & Odile Marcotte & François Soumis, 2006. "A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem," Operations Research, INFORMS, vol. 54(1), pages 130-149, February.
    16. Fagerholt, Kjetil, 2001. "Ship scheduling with soft time windows: An optimisation based approach," European Journal of Operational Research, Elsevier, vol. 131(3), pages 559-571, June.
    17. Chang, Yu-Hern & Yeh, Chung-Hsing & Shen, Ching-Cheng, 2000. "A multiobjective model for passenger train services planning: application to Taiwan's high-speed rail line," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 91-106, February.
    18. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    19. Shyam S. G. Perumal & Jesper Larsen & Richard M. Lusby & Morten Riis & Tue R. L. Christensen, 2022. "A column generation approach for the driver scheduling problem with staff cars," Public Transport, Springer, vol. 14(3), pages 705-738, October.
    20. Purnell, K. & Bruce, A.G. & MacGill, I., 2022. "Impacts of electrifying public transit on the electricity grid, from regional to state level analysis," Applied Energy, Elsevier, vol. 307(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:147:y:2006:i:1:p:199-216:10.1007/s10479-006-0066-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.