Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download file Download BibTeX

Title

Determining Lower Bound on Number of Vehicle Blocks in Multi-Depot Vehicle Scheduling Problem with Mixed Fleet Covering Electric Buses

Authors

[ 1 ] Instytut Transportu, Wydział Inżynierii Lądowej i Transportu, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.7] Civil engineering, geodesy and transport

Year of publication

2023

Published in

Archives of Transport

Journal year: 2023 | Journal volume: vol. 65 | Journal number: no. 1

Article type

scientific article

Publication language

english

Keywords
EN
  • vehicle scheduling
  • lower bound
  • public transport
  • mixed fleet
  • electric buses
Abstract

EN 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.

Pages (from - to)

27 - 38

DOI

10.5604/01.3001.0016.2475

URL

https://aot.publisherspanel.com/resources/html/article/details?id=235301

License type

CC BY (attribution alone)

Open Access Mode

open journal

Open Access Text Version

final published version

Date of Open Access to the publication

at the time of publication

Full text of article

Download file

Access level to full text

public

Ministry points / journal

140

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.