Home > Research > Publications & Outputs > The rescheduling school bus routing problem und...

Research

Associated organisational units

Electronic data

Links

Text available via DOI:

View graph of relations

The rescheduling school bus routing problem under a constraint on the number of students with negative impact

Research output: Contribution to Journal/Magazine › Journal article › peer-review

E-pub ahead of print

Standard

The rescheduling school bus routing problem under a constraint on the number of students with negative impact. / Dinh, Quy Ta; Dang, Thu; Ha, Minh Hoang et al.
In: Journal of the Operational Research Society, 29.06.2025, p. 1-20.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Dinh, QT, Dang, T, Ha, MH, Vu, DM & Mai, T 2025, 'The rescheduling school bus routing problem under a constraint on the number of students with negative impact', Journal of the Operational Research Society, pp. 1-20. https://doi.org/10.1080/01605682.2025.2519991

APA

Dinh, Q. T., Dang, T., Ha, M. H., Vu, D. M., & Mai, T. (2025). The rescheduling school bus routing problem under a constraint on the number of students with negative impact. Journal of the Operational Research Society, 1-20. Advance online publication. https://doi.org/10.1080/01605682.2025.2519991

Vancouver

Dinh QT, Dang T, Ha MH, Vu DM, Mai T. The rescheduling school bus routing problem under a constraint on the number of students with negative impact. Journal of the Operational Research Society. 2025 Jun 29;1-20. Epub 2025 Jun 29. doi: 10.1080/01605682.2025.2519991

Author

Dinh, Quy Ta ; Dang, Thu ; Ha, Minh Hoang et al. / The rescheduling school bus routing problem under a constraint on the number of students with negative impact. In: Journal of the Operational Research Society. 2025 ; pp. 1-20.

Bibtex

@article{b91868b18a2f4d3a8c85c99d3668821f,
title = "The rescheduling school bus routing problem under a constraint on the number of students with negative impact",
abstract = "This study presents a case study of the School Bus Routing Problem (SBRP), focusing on improving the quality of student transportation services. Although numerous studies have addressed the SBRP, this study tackles a new variant driven by a negative impact policy to limit the number of continuing students facing extended travel times. We present this variant and propose a mathematical formulation along with a hybrid metaheuristic approach for it. Furthermore, we conduct comprehensive experiments to evaluate algorithms{\textquoteright} performance and various configurations of the negative impact policy on both artificial and real instances. Computational results confirm the effectiveness of our hybrid algorithm.",
author = "Dinh, {Quy Ta} and Thu Dang and Ha, {Minh Hoang} and Vu, {Duc Minh} and Tien Mai",
year = "2025",
month = jun,
day = "29",
doi = "10.1080/01605682.2025.2519991",
language = "English",
pages = "1--20",
journal = "Journal of the Operational Research Society",
issn = "0160-5682",
publisher = "Taylor and Francis Ltd.",

}

RIS

TY - JOUR

T1 - The rescheduling school bus routing problem under a constraint on the number of students with negative impact

AU - Dinh, Quy Ta

AU - Dang, Thu

AU - Ha, Minh Hoang

AU - Vu, Duc Minh

AU - Mai, Tien

PY - 2025/6/29

Y1 - 2025/6/29

N2 - This study presents a case study of the School Bus Routing Problem (SBRP), focusing on improving the quality of student transportation services. Although numerous studies have addressed the SBRP, this study tackles a new variant driven by a negative impact policy to limit the number of continuing students facing extended travel times. We present this variant and propose a mathematical formulation along with a hybrid metaheuristic approach for it. Furthermore, we conduct comprehensive experiments to evaluate algorithms’ performance and various configurations of the negative impact policy on both artificial and real instances. Computational results confirm the effectiveness of our hybrid algorithm.

AB - This study presents a case study of the School Bus Routing Problem (SBRP), focusing on improving the quality of student transportation services. Although numerous studies have addressed the SBRP, this study tackles a new variant driven by a negative impact policy to limit the number of continuing students facing extended travel times. We present this variant and propose a mathematical formulation along with a hybrid metaheuristic approach for it. Furthermore, we conduct comprehensive experiments to evaluate algorithms’ performance and various configurations of the negative impact policy on both artificial and real instances. Computational results confirm the effectiveness of our hybrid algorithm.

U2 - 10.1080/01605682.2025.2519991

DO - 10.1080/01605682.2025.2519991

M3 - Journal article

SP - 1

EP - 20

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

SN - 0160-5682

ER -