Matheuristics for a multi-day electric bus assignment and overnight recharge scheduling problem - Université de Tours Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Matheuristics for a multi-day electric bus assignment and overnight recharge scheduling problem

Résumé

To limit greenhouse gas emissions in the public transportation sector, transit authorities are constantly increasing the proportion of electric buses (EBs) in their fleets. Due to space and budget constraints, more often than not, the number of chargers that can be installed at the depots is inferior to the number of EBs in the fleet. Moreover, even if there is a 1-to-1 match between EBs and available chargers, it is virtually impossible to use all the chargers at the same time due to maximum power grid constraints. Thus, it is necessary to develop methods in order to recharge the buses in an efficient and acute way, taking into account these charging infrastructure capacity constraints. In this study, we consider a multi-day electric bus assignment and overnight recharge scheduling problem which can be defined as follows. A set of vehicle blocks is defined over several days. Each block represents a one-day long fixed sequence of bus trips starting and ending at the same depot. A set of identical buses and a set of chargers are available to a depot. The problem consists in assigning a bus to each vehicle block and to schedule the bus overnight recharging operations at the depot, such that i) the buses always have sufficient energy to complete their vehicle blocks and ii) the depot charging capacity is never exceeded every night. The objectives are twofold: minimizing the total charging costs and minimizing the long-run damages on the battery. Indeed, the battery represents a substantial part of the purchase cost of an EB and its lifetime is strongly impacted by decisions such as: the state of charge level during storage and the battery storage conditions, among others. We first model this problem as a mixed integer linear program (MILP) that can be solved with a commercial MILP solver. Then, to yield faster computational times, we develop two multi-stage matheuristics based on the MILP. To show the interest of considering a multiple-day horizon, we introduce two other matheuristics that mimic current industrial practices and solve the problem sequentially, one day at a time. To evaluate all these algorithms, we used a set of 264 instances generated using data provided by Giro, an IT company that commercializes optimization software for public transit.
Fichier non déposé

Dates et versions

hal-03579961 , version 1 (22-08-2022)

Identifiants

  • HAL Id : hal-03579961 , version 1

Citer

Pierre Vendé, Guy Desaulniers, Yannick Kergosien, Jorge E Mendoza. Matheuristics for a multi-day electric bus assignment and overnight recharge scheduling problem. VeRoLog 2022, Jun 2022, Hambourg, Germany. ⟨hal-03579961⟩
70 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More