التفاصيل البيبلوغرافية
| العنوان: |
The cumulative school bus routing problem: Polynomial‐size formulations. |
| المؤلفون: |
Farzadnia, Farnaz, Bektaş, Tolga, Lysgaard, Jens |
| المصدر: |
Networks; Dec2023, Vol. 82 Issue 4, p571-591, 21p |
| مصطلحات موضوعية: |
SCHOOL buses, VEHICLE routing problem, MIXED integer linear programming, TRANSPORTATION of school children |
| مستخلص: |
This article introduces the cumulative school bus routing problem, which concerns the transport of students from a school using a fleet of identical buses. The objective of the problem is to select a drop‐off point for each student among potential locations within a certain walking distance and to generate routes such that the sum of arrival times of all students from their school to their homes is minimized. The article describes six polynomial‐size mixed integer linear programming formulations based on original and auxiliary graphs, and the formulations are numerically compared on real instances. The article reports the results of computational experiments performed to evaluate the performance of the proposed models. [ABSTRACT FROM AUTHOR] |
|
Copyright of Networks is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
Full Text Finder