Browsing by Subject "Vehicle Scheduling Problem"

Now showing 1 - 1 of 1

Access status: Open Access ,
Deadhead Minimization Problem in Multi-Depot Public Transport System
(Wydawnictwa AGH, 2021) Szczyrbak, Robert
This paper addresses a vehicle scheduling problem in the public transport system of Krakow, Poland. The primary objective is to develop and evaluate a mathematical model for assigning bus schedules to depots in a way that minimizes non-revenue (deadhead) kilometers. The proposed model, referred to as the Deadhead Minimization Problem in Multi-Depot Public Transport System (DMPMDPTS), seeks to reduce the total distance that is traveled by vehicles from their home depots to the starting points of their first scheduled routes and from the final terminals back to their depots. The model assumes fixed-route structures and known deadhead distances between terminals. Real-world data that was based on the Krakow Municipal Transport (KKM) was used to validate and verify the model. The optimization model was implemented in AMPL and solved using the GLPK Integer Optimizer (v4.43). Computational experiments were conducted across multiple cases that differed in their constraints and parameters in order to assess the model’s flexibility and performance. In all of the cases, optimal solutions were obtained in brief computation times. Compared to the existing operational schedules, the model consistently reduced deadhead kilometers. Case 1 achieved improvements without altering the numbers of vehicles per depot, while Case 2 led to further reductions of the costs of redistributing vehicles among depots, resulting in a less-balanced load structure. These findings demonstrated the model’s potential for supporting decision-making in depot allocation within public transport operations.