EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
996. A matheuristic for a multi-day electric bus assignment and recharge scheduling problem
Invited abstract in session TB-51: Electric Busses, stream Public Transport Optimization.
Tuesday, 10:30-12:00Room: M5 (building: 101)
Authors (first author is the speaker)
1. | Pierre Vendé
|
Operation management and Logistics, HEC Montréal | |
2. | Guy Desaulniers
|
École Polytechnique de Montréal and GERAD | |
3. | Michel Gendreau
|
MAGI and CIRRELT, Polytechnique Montréal | |
4. | Yannick Kergosien
|
Université de Tours | |
5. | Jorge E. Mendoza
|
HEC Montréal |
Abstract
To limit greenhouse gas emissions in the public transportation sector, transit authorities are constantly increasing the proportion of electric buses (EBs) in their fleets, creating complex decision problems to charge the vehicles. In order to facilitate the scheduling of all charging operations, it might be efficient to charge EBs both overnight and at long-term stops during the day, to balance the charged quantities. In this study, we consider a multi-day electric bus assignment and recharge scheduling problem which can be defined as follows. Given a set of vehicle blocks (sequences of timetabled bus trips that should be operated by the same bus on a given day), a set of EBs and a set of chargers, the objective is to assign an EB to each block over multiple days and to schedule both overnight and en-route recharging operations. Chargers are installed at the depot, and sufficiently long stops. Each charger has its own charging function represented by a piecewise linear function. The decision are made ensuring that the EBs never run out of energy performing their assigned blocks, the charging capacity at any location should not be exceeded, and the sum of the total charging costs and long run damages on the battery are minimized. We first model this problem as a MILP that can be solved with a commercial solver. Then, to yield faster computational times, we propose an iterative matheuristic based on the MILP.
Keywords
- Public Local Transportation Systems
- OR in Sustainability
Status: accepted
Back to the list of papers