Determining lower bound on number of vehicle blocks in multi-depot vehicle scheduling problem with mixed fleet covering electric buses
Authors:
- Jerzy Duda,
- Szymon Fierek,
- Marek Karkula,
- Piotr Kisielewski,
- Radosław Puka,
- Adam Redmer,
- Iwona Skalna
Abstract
Scheduling buses in public transport systems consists in assigning trips to vehicle blocks. To minimize the cost of fuel and environmental impact of public transport, the number of vehicle blocks used should be as small as possible, but sufficient to cover all trips in a timetable. However, when solving real life transportation problems, it is difficult to decide whether the number of vehicle blocks obtained from an algorithm is minimal, unless the actual minimal number is already known, which is rare, or the theoretical lower bound on the number of vehicles has been determined. The lower bound on the number of vehicle blocks is even more important and useful since it can be used both as a parameter that controls the optimization process and as the minimum expected value of the respective optimization criterion. Therefore, methods for determining the lower bound in transportation optimization problems have been studied for decades. However, the existing methods for determining the lower bound on the number of vehicle blocks are very limited and do not take multiple depots or heterogeneous fleet of vehicles into account. In this research, we propose a new practical and effective method to assess the lower bound on the number of vehicle blocks in the Multi-Depot Vehicle Scheduling Problem (MDVSP) with a mixed fleet covering electric vehicles (MDVSP-EV). The considered MDVSP-EV reflects a problem of public transport planning encountered in medium-sized cities. The experimental results obtained for a real public transport system show the great potential of the proposed method in determining the fairly strong lower bound on the number of vehicle blocks. The method can generate an estimated distribution of the number of blocks during the day, which may be helpful, for example, in planning duties and crew scheduling. An important advantage of the proposed method is its low calculation time, which is very important when solving real life transportation problems.
- Record ID
- CUT1b23b11691c1426ebec8b21ed3ebcd47
- Publication categories
- ;
- Author
- Journal series
- Archives of Transport, ISSN 0866-9546, e-ISSN 2300-8830
- Issue year
- 2023
- Vol
- 65
- No
- 1
- Pages
- 27-38
- Other elements of collation
- tab.; wykr.; Bibliografia (na s.) - 36-38; Bibliografia (liczba pozycji) - 28; Oznaczenie streszczenia - Abstr.; Numeracja w czasopiśmie - Vol. 65, Iss. 1
- Keywords in English
- vehicle scheduling, lower bound, public transport, mixed fleet, electric buses
- ASJC Classification
- ;
- DOI
- DOI:10.5604/01.3001.0016.2475 Opening in a new tab
- URL
- https://aot.publisherspanel.com/resources/html/article/details?id=235301 Opening in a new tab
- Related project
- Optymalizacja planowania zadań transportowych w komunikacji miejskiej pod kątem elektromobiności. . Project leader at PK: , ,
- Language
- eng (en) English
- License
- Score (nominal)
- 140
- Score source
- journalList
- Score
- Publication indicators
- Additional fields
- Indeksowana w: Scopus
- Uniform Resource Identifier
- https://cris.pk.edu.pl/info/article/CUT1b23b11691c1426ebec8b21ed3ebcd47/
- URN
urn:pkr-prod:CUT1b23b11691c1426ebec8b21ed3ebcd47
* presented citation count is obtained through Internet information analysis, and it is close to the number calculated by the Publish or PerishOpening in a new tab system.