IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v76y2025i10p2098-2111.html
   My bibliography  Save this article

A matheuristic algorithm for the school bus routing problem

Author

Listed:
  • Iderval da Costa e Silva
  • Ewerton Teixeira
  • Raphael Kramer
  • Teobaldo Bulhões
  • Anand Subramanian

Abstract

This paper addresses a variant of the school bus routing problem, which involves decisions related to the selection of bus stops from a set of predefined candidate locations, the assignment of students to stops, and the routing of buses. The objective consists in minimizing the total routing cost for picking up students at the bus stops and delivering them to a single school, satisfying the vehicle capacity and the maximum walking distance for students to reach the stops. To solve the problem, we propose a matheuristic algorithm that combines iterated local search (ILS) with an exact procedure based on integer linear programming (ILP). In particular, the ILS procedure makes use of several neighborhoods and auxiliary data structures to efficiently explore the solution search space, whereas the ILP approach attempts to optimally combine the most promising routes found during the search. The proposed algorithm was tested on 112 benchmark instances and it was shown to be capable of providing high-quality solutions, 19 of which were better than the best ones from the literature.

Suggested Citation

  • Iderval da Costa e Silva & Ewerton Teixeira & Raphael Kramer & Teobaldo Bulhões & Anand Subramanian, 2025. "A matheuristic algorithm for the school bus routing problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 76(10), pages 2098-2111, October.
    • Handle: RePEc:taf:tjorxx:v:76:y:2025:i:10:p:2098-2111
    DOI: 10.1080/01605682.2025.2457651
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2025.2457651
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2025.2457651?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

    for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:76:y:2025:i:10:p:2098-2111. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.