IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v229y2013i2p518-528.html
   My bibliography  Save this article

A metaheuristic for the school bus routing problem with bus stop selection

Author

Listed:
  • Schittekat, Patrick
  • Kinable, Joris
  • Sörensen, Kenneth
  • Sevaux, Marc
  • Spieksma, Frits
  • Springael, Johan

Abstract

Existing literature on routing of school buses has focused mainly on building intricate models that attempt to capture as many real-life constraints and objectives as possible. In contrast, the focus of this paper is on understanding the joint problem of bus route generation and bus stop selection – two important sub-problems – in its most basic form. To this end, this paper defines the school bus routing problem (SBRP) as a variant of the vehicle routing problem in which three simultaneous decisions have to be made: (1) determine the set of stops to visit, (2) determine for each student which stop (s)he should walk to, and (3) determine routes that lie along the chosen stops, so that the total traveled distance is minimized. An MIP model of this basic problem is developed.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:229:y:2013:i:2:p:518-528
    DOI: 10.1016/j.ejor.2013.02.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713001586
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2013.02.025?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. Park, Junhyuk & Tae, Hyunchul & Kim, Byung-In, 2012. "A post-improvement procedure for the mixed load school bus routing problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 204-213.
    2. Baldacci, R. & Dell'Amico, M., 2010. "Heuristic algorithms for the multi-depot ring-star problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 270-281, May.
    3. Gilbert Laporte & Yves Nobert & Serge Taillefer, 1988. "Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems," Transportation Science, INFORMS, vol. 22(3), pages 161-172, August.
    4. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    5. 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.
    6. L Y O Li & Z Fu, 2002. "The school bus routing problem: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(5), pages 552-558, May.
    7. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    8. Chapleau, Luc & Ferland, Jacques-A. & Rousseau, Jean-Marc, 1985. "Clustering for routing in densely populated areas," European Journal of Operational Research, Elsevier, vol. 20(1), pages 48-57, April.
    9. Lawrence D. Bodin & Lon Berman, 1979. "Routing and Scheduling of School Buses by Computer," Transportation Science, INFORMS, vol. 13(2), pages 113-129, May.
    10. 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.
    11. Andreas Drexl, 1991. "Scheduling of Project Networks by Job Assignment," Management Science, INFORMS, vol. 37(12), pages 1590-1602, December.
    Full references (including those not matched with items on IDEAS)

    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. 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).
    2. 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.
    3. 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.
    4. 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.
    5. Ansari, Azadeh & Farrokhvar, Leily & Kamali, Behrooz, 2021. "Integrated student to school assignment and school bus routing problem for special needs students," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    6. Shafahi, Ali & Wang, Zhongxiang & Haghani, Ali, 2018. "SpeedRoute: Fast, efficient solutions for school bus routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 473-493.
    7. Perugia, Alessandro & Moccia, Luigi & Cordeau, Jean-François & Laporte, Gilbert, 2011. "Designing a home-to-work bus service in a metropolitan area," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1710-1726.
    8. Xiaopan Chen & Yunfeng Kong & Lanxue Dang & Yane Hou & Xinyue Ye, 2015. "Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-20, July.
    9. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    10. 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.
    11. 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.
    12. 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.
    13. Amanda Chu & Pinar Keskinocak & Monica C. Villarreal, 2020. "Introduction: Empowering Denver Public Schools to Optimize School Bus Operations," Interfaces, INFORMS, vol. 50(5), pages 298-312, September.
    14. Ellegood, William A. & Campbell, James F. & North, Jeremy, 2015. "Continuous approximation models for mixed load school bus routing," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 182-198.
    15. 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.
    16. Dasdemir, Erdi & Testik, Murat Caner & Öztürk, Diclehan Tezcaner & Şakar, Ceren Tuncer & Güleryüz, Güldal & Testik, Özlem Müge, 2022. "A multi-objective open vehicle routing problem with overbooking: Exact and heuristic solution approaches for an employee transportation problem," Omega, Elsevier, vol. 108(C).
    17. Kuo, Yong-Hong & Leung, Janny M.Y. & Yan, Yimo, 2023. "Public transport for smart cities: Recent innovations and future challenges," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1001-1026.
    18. Monnerat, Filipe & Dias, Joana & Alves, Maria João, 2019. "Fleet management: A vehicle and driver assignment model," European Journal of Operational Research, Elsevier, vol. 278(1), pages 64-75.
    19. Ezquerro Eguizábal, Sara & Moura Berodia, José Luis & Ibeas Portilla, Ángel & Benavente Ponce, Juan, 2018. "Optimization model for school transportation design based on economic and social efficiency," Transport Policy, Elsevier, vol. 67(C), pages 93-101.
    20. Olmez, Omer Berk & Gultekin, Ceren & Balcik, Burcu & Ekici, Ali & Özener, Okan Örsan, 2022. "A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem," European Journal of Operational Research, Elsevier, vol. 302(1), pages 187-202.

    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:eee:ejores:v:229:y:2013:i:2:p:518-528. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.