عرض بسيط للتسجيلة

Solving a Bus Routing Problem Arising in Doha

المؤلفAljundi, A.
المؤلفKhatib, M.A.
المؤلفKharbeche, M.
المؤلفHaouari, M.
تاريخ الإتاحة2024-03-12T06:59:11Z
تاريخ النشر2022
اسم المنشورIEEE International Conference on Industrial Engineering and Engineering Management
المصدرScopus
الرقم المعياري الدولي للكتاب21573611
معرّف المصادر الموحدhttp://dx.doi.org/10.1109/IEEM55944.2022.9989640
معرّف المصادر الموحدhttp://hdl.handle.net/10576/52929
الملخصThe 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.
راعي المشروعACKNOWLEDGMENTS 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.
اللغةen
الناشرIEEE Computer Society
الموضوعmaximum travel time
mixed integer-programming
school bus routing
العنوانSolving a Bus Routing Problem Arising in Doha
النوعConference Paper
الصفحات600-604
رقم المجلد2022-December


الملفات في هذه التسجيلة

الملفاتالحجمالصيغةالعرض

لا توجد ملفات لها صلة بهذه التسجيلة.

هذه التسجيلة تظهر في المجموعات التالية

عرض بسيط للتسجيلة