The cumulative school bus routing problem:: Polynomial-size formulations

Farnaz Farzadnia; Tolga Bektas; Jens Lysgaard

doi:10.1002/net.22179

The cumulative school bus routing problem: Polynomial-size formulations

Farnaz Farzadnia^*, Tolga Bektas, Jens Lysgaard

^*Corresponding author for this work

Department of Economics and Business Economics

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

1 Citation (Scopus)

Abstract

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.

Original language	English
Journal	Networks
Volume	82
Pages (from-to)	571-591
Number of pages	21
ISSN	0028-3045
DOIs	https://doi.org/10.1002/net.22179
Publication status	Published - Dec 2023

Keywords

fairness
integer programming
minimum latency
multimodal transport
public transport
school bus routing

Access to Document

10.1002/net.22179Licence: CC BY

Networks - 2023 - Farzadnia - The cumulative school bus routing problem Polynomial‐size formulationsFinal published version, 2.08 MBLicence: CC BY

Cite this

@article{e34a05c930e24b058bc0c861aebcc76c,

title = "The cumulative school bus routing problem:: Polynomial-size formulations",

abstract = "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.",

keywords = "fairness, integer programming, minimum latency, multimodal transport, public transport, school bus routing",

author = "Farnaz Farzadnia and Tolga Bektas and Jens Lysgaard",

year = "2023",

month = dec,

doi = "10.1002/net.22179",

language = "English",

volume = "82",

pages = "571--591",

journal = "Networks",

issn = "0028-3045",

publisher = "Wiley-Liss Inc.",

}

TY - JOUR

T1 - The cumulative school bus routing problem:

T2 - Polynomial-size formulations

AU - Farzadnia, Farnaz

AU - Bektas, Tolga

AU - Lysgaard, Jens

PY - 2023/12

Y1 - 2023/12

N2 - 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.

AB - 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.

KW - fairness

KW - integer programming

KW - minimum latency

KW - multimodal transport

KW - public transport

KW - school bus routing

UR - http://www.scopus.com/inward/record.url?scp=85167581847&partnerID=8YFLogxK

U2 - 10.1002/net.22179

DO - 10.1002/net.22179

M3 - Journal article

SN - 0028-3045

VL - 82

SP - 571

EP - 591

JO - Networks

JF - Networks

ER -

The cumulative school bus routing problem: Polynomial-size formulations

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this