# Department of Economics and Business Economics

## Solving the service-oriented single-route school bus routing problem: Exact and heuristic solutions

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

### Standard

In: EURO Journal on Transportation and Logistics, Vol. 10, 100054, 2021.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

### Vancouver

Farzadnia F, Lysgaard J. Solving the service-oriented single-route school bus routing problem: Exact and heuristic solutions. EURO Journal on Transportation and Logistics. 2021;10:100054. doi: 10.1016/j.ejtl.2021.100054

### Bibtex

@article{6134168af1e142c19313d5b512574332,
title = "Solving the service-oriented single-route school bus routing problem: Exact and heuristic solutions",
abstract = "This paper addresses a school bus routing problem, which is classified as a location–allocation–routing problem. The problem consists of selecting pickup locations, allocating students to them, and generating a route that traverses between them. The proposed model is for a single school and a single-route. The objective is to find the subset of pickup stops aiming to minimize the total distance walked by all students from their homes to the respective pickup stops, subject to an upper bound on the route distance of connecting selected stops. We present an exact and heuristic algorithms which are developed based on a layered graph. Computational results are conducted on a series of generated benchmark instances and test data from Norway that demonstrate a good performance of the proposed approach.",
author = "Farnaz Farzadnia and Jens Lysgaard",
year = "2021",
doi = "10.1016/j.ejtl.2021.100054",
language = "English",
volume = "10",
journal = "EURO Journal on Transportation and Logistics",
issn = "2192-4376",
publisher = "Springer",

}

### RIS

TY - JOUR

T1 - Solving the service-oriented single-route school bus routing problem

T2 - Exact and heuristic solutions

AU - Lysgaard, Jens

PY - 2021

Y1 - 2021

N2 - This paper addresses a school bus routing problem, which is classified as a location–allocation–routing problem. The problem consists of selecting pickup locations, allocating students to them, and generating a route that traverses between them. The proposed model is for a single school and a single-route. The objective is to find the subset of pickup stops aiming to minimize the total distance walked by all students from their homes to the respective pickup stops, subject to an upper bound on the route distance of connecting selected stops. We present an exact and heuristic algorithms which are developed based on a layered graph. Computational results are conducted on a series of generated benchmark instances and test data from Norway that demonstrate a good performance of the proposed approach.

AB - This paper addresses a school bus routing problem, which is classified as a location–allocation–routing problem. The problem consists of selecting pickup locations, allocating students to them, and generating a route that traverses between them. The proposed model is for a single school and a single-route. The objective is to find the subset of pickup stops aiming to minimize the total distance walked by all students from their homes to the respective pickup stops, subject to an upper bound on the route distance of connecting selected stops. We present an exact and heuristic algorithms which are developed based on a layered graph. Computational results are conducted on a series of generated benchmark instances and test data from Norway that demonstrate a good performance of the proposed approach.

U2 - 10.1016/j.ejtl.2021.100054

DO - 10.1016/j.ejtl.2021.100054

M3 - Journal article

VL - 10

JO - EURO Journal on Transportation and Logistics

JF - EURO Journal on Transportation and Logistics

SN - 2192-4376

M1 - 100054

ER -