Show simple item record

AuthorAljundi, A.
AuthorKhatib, M.A.
AuthorKharbeche, M.
AuthorHaouari, M.
Available date2024-03-12T06:59:11Z
Publication Date2022
Publication NameIEEE International Conference on Industrial Engineering and Engineering Management
ResourceScopus
ISSN21573611
URIhttp://dx.doi.org/10.1109/IEEM55944.2022.9989640
URIhttp://hdl.handle.net/10576/52929
AbstractThe generic variant of the school bus routing problem requires finding a set of routes that cover a predefined set of student pickup locations in order to minimize travel time while satisfying various constraints. In this paper, we study a new variant of the problem that was motivated by a real-world application in Doha, Qatar. In this variant, two objectives are considered: minimizing the number of buses and achieving a goal of not exceeding a predefined maximum travel time. We propose a compact mixed-integer programming problem and present how it can be solved heuristically to derive high-quality solutions for large-size instances.
SponsorACKNOWLEDGMENTS This publication was made possible by the Collaborative Grant [QUCG-CENG-21/22-5] from Qatar University. The statements made herein are solely the responsibility of the authors.
Languageen
PublisherIEEE Computer Society
Subjectmaximum travel time
mixed integer-programming
school bus routing
TitleSolving a Bus Routing Problem Arising in Doha
TypeConference Paper
Pagination600-604
Volume Number2022-December
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record