EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

3571. The Cumulative School Bus Routing Problem: Polynomial-Size Formulations

Invited abstract in session TD-58: MILPs for Vehicle Routing 1, stream VeRoLog - Vehicle Routing and Logistics.

Tuesday, 14:30-16:00
Room: S07 (building: 101)

Authors (first author is the speaker)

1. Farnaz Farzadnia
Economics, Copenhagen Business School
2. Jens Lysgaard
Department of Economics and Business Economics, Aarhus University
3. Tolga Bektas
University of Liverpool Management School, University of Liverpool

Abstract

This article challenges the conventional notion that minimizing shortest paths guarantees the fastest passengers arrivals at destinations. Instead we present a fresh perspective in the school bus routing problem. This article introduces the cumulative school bus routing problem, which 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

Status: accepted

Back to the list of papers