Sn Computer Science

Journal Information
ISSN / EISSN: 2662995X / 26618907
Published by: Springer Nature
Total articles ≅ 1,423

Latest articles in this journal

Published: 1 December 2022
Sn Computer Science, Volume 4, pp 1-10; https://doi.org/10.1007/s42979-022-01478-2

The publisher has not yet granted permission to display this abstract.
, A. Usha Ruby, J. Vidya
Published: 29 November 2022
Sn Computer Science, Volume 4, pp 1-10; https://doi.org/10.1007/s42979-022-01485-3

The publisher has not yet granted permission to display this abstract.
Published: 29 November 2022
Sn Computer Science, Volume 4, pp 1-15; https://doi.org/10.1007/s42979-022-01466-6

Abstract:
This paper addresses a school bus routing problem formulated as a capacitated and time-constrained open vehicle routing problem with a heterogeneous fleet and single loads. This problem incorporates several realistic features, such as student eligibility, maximum walking distances, bus stop selection, maximum riding times, different types of buses, multistops, and bus dwell times. A heuristic algorithm based on an iterated local search approach is proposed for this problem. It determines the selection of bus stops from a set of potential stops, the assignment of students to the selected bus stops, and the routes along the selected bus stops. The main objectives are minimizing the number of buses used, the total student walking distance, and the total route journey time. Other aims are balancing route journey times between buses and minimizing the total number of empty seats. A set of 20 real-world problem instances are used to evaluate the performance of the algorithm. Results indicate that the algorithm finds high-quality solutions in very short amounts of computational time.
Back to Top Top