Abstract
One category of vehicle routing problems involving groups of people where there can be multiple possible drop-off locations is the School Bus Routing Problem (SBRP). In this paper, we investigate a form of SBRP where each passenger has a well-ordered set of preferred stops, e.g., the preferences can be based on the distance to their destination. The passengers continue their journey from the stop to their destination by an alternative mode, such as walking. Different drop-off choices allow for a different set of passengers to be dropped off together, affecting the total vehicle driving distance. As the transport provider and passengers have their own objectives, inevitably, there are two opposing goals (tradeoff aspects), reducing total driving distance versus passenger walking distance. Unlike typical SBRP, we focus on practical problems where the set of passengers is not known well in advance and there is only a short time window to compute a solution (a real-time requirement). Hence, runtime efficiency is more important than optimality. We introduce this variant as SBRP-RT, a school bus routing problem with tradeoff aspects and real-time requirements. We propose a model with an efficient greedy local search for such problems, and demonstrate the efficacy with experiments on real-world datasets with quick solving that balances tradeoffs.
Similar content being viewed by others
Data availability
Not applicable.
Code availability
Not applicable.
References
Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, USA (2001)
Kilby, P., Shaw, P.: Vehicle routing. In: Handbook of Constraint Programming, pp. 801–836. Elsevier Science Inc., USA (2006)
Park, J., Kim, B.-I.: The school bus routing problem: A review. Eur. J. Oper. Res. 202(2) (2010)
Ellegood, W.A., Solomon, S., North, J., Campbell, J.F.: School bus routing problem: Contemporary trends and research directions. Manag. Sci. 95 (2020)
Effendy, S., Ngo, B.C., Yap, R.H.C.: An efficient heuristic for passenger bus VRP with preferences and tradeoffs. In: LION15 (2021)
Schittekat, P., Kinable, J., Sörensen, K., Sevaux, M., Spieksma, F., Springael, J.: A metaheuristic for the school bus routing problem with bus stop selection. Eur. J. Oper. Res. 229(2) (2013)
Lewis, R., Smith-Miles, K.: A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. J. Discret. Algoritm. 52 (2018)
Ghiani, G., Improta, G.: An efficient transformation of the generalized vehicle routing problem. Eur. J. Oper. Res. 122(1) (2000)
Pop, P.C., Zelina, I., Lupşe, V., Sitar, C.P., Chira, C.: Heuristic algorithms for solving the generalized vehicle routing problem. Int. J. Comput. Commun. Control 6(1) (2011)
Pop, P.C., Kara, I., Marc, A.H.: New mathematical models of the generalized vehicle routing problem and extensions. Appl. Math. Model. 36(1) (2012)
Pop, P.C., Matei, O., Sitar, C.P.: An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109 (2013)
Moccia, L., Cordeau, J.-F., Laporte, G.: An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. J. Oper. Res. Soc. 63(2) (2012)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103 (1972)
Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of computer and system sciences 9(3), 256–278 (1974)
Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3) (1979)
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM (JACM) 45(4), 634–652 (1998)
Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing, pp. 624–633 (2014)
Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1) (1959)
Ralphs, T.K., Kopman, L., Pulleyblank, W.R., Trotter, L.E.: On the capacitated vehicle routing problem. Math. Program. 94(2) (2003)
Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: VRP with time windows. In: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, USA (2002)
Acknowledgements
We are grateful for the help and problem sets provided by Versafleet (https://versafleet.co/).
Funding
This research is supported by grant R-252-000-B58-114.
Author information
Authors and Affiliations
Contributions
The authors contributed equally to this work.
Corresponding author
Ethics declarations
Ethics approval
Not applicable.
Consent to participate
Not applicable.
Consent for publication
Not applicable.
Competing interests
The authors have no conflicts of interest to declare that are relevant to the content of this paper.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Effendy, S., Yap, R.H.C. Real-time passenger bus routing problems with preferences and tradeoffs. Ann Math Artif Intell 91, 287–307 (2023). https://doi.org/10.1007/s10472-022-09812-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-022-09812-3