A strategy for clustering students minimizing the number of bus stops for solving the school bus routing problem

João F.M. Sarubbi, Caio M.R. Mesquita, Elizabeth F. Wanner, Vinicius F. Santos, Cristiano M. Silva

Research output: Chapter in Book/Report/Conference proceedingConference publication

Abstract

In this work we tackle the bus stop selection step for the School Bus Routing Problem (SBRP). Our goal is to minimize the number of bus stops in order to assign all students to a bus stop respecting a home-to-bus-stop walking distance constraint. Our strategy creates a large number of possible bus stops points in a road network and uses a pseudo-random constructive heuristic algorithm to assign students to a bus stops. Our approach is tested on a real georeferenced data of a Brazilian city and is compared with a different methodology. Results demonstrate that the proposed approach is able to find good solutions for this optimization problem. Besides, the higher the number of possible points to install bus stops, the smaller is the number of bus stops required to attend all students.

Original languageEnglish
Title of host publicationProceedings of the NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium 2016
EditorsSema Oktug, Mehmet Ulema, Cicek Cavdar, et al
PublisherIEEE
Pages1175-1180
Number of pages6
ISBN (Electronic)978-1-5090-0223-8
DOIs
Publication statusPublished - 30 Jun 2016
Event2016 IEEE/IFIP Network Operations and Management Symposium - Istanbul, Turkey
Duration: 25 Apr 201629 Apr 2016

Publication series

Name
ISSN (Print)2374-9709

Symposium

Symposium2016 IEEE/IFIP Network Operations and Management Symposium
Abbreviated titleNOMS 2016
CountryTurkey
CityIstanbul
Period25/04/1629/04/16

Bibliographical note

© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Keywords

  • bus stop selection
  • constructive greedy heuristic
  • school bus routing problem

Fingerprint Dive into the research topics of 'A strategy for clustering students minimizing the number of bus stops for solving the school bus routing problem'. Together they form a unique fingerprint.

  • Research Output

    • 1 Conference contribution

    A GRASP-based heuristic for allocating the roadside infrastructure maximizing the number of distinct vehicles experiencing contact opportunities

    Sarubbi, J. F. M., Cravieé de A. Vieira, D., Wanner, E. F. & Silva, C. M., 30 Jun 2016, Proceedings of the NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium 2016. Oktug, S., Ulema, M., Cavdar, C. & et al (eds.). IEEE, p. 1187-1192 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference publication

    Open Access
    File
  • Cite this

    Sarubbi, J. F. M., Mesquita, C. M. R., Wanner, E. F., Santos, V. F., & Silva, C. M. (2016). A strategy for clustering students minimizing the number of bus stops for solving the school bus routing problem. In S. Oktug, M. Ulema, C. Cavdar, & et al (Eds.), Proceedings of the NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium 2016 (pp. 1175-1180). IEEE. https://doi.org/10.1109/NOMS.2016.7502983