Data Reduction Algorithm for the Electric Bus Scheduling Problem

Maros Janovec () and Michal Kohani ()
Additional contact information
Maros Janovec: University of Zilina
Michal Kohani: University of Zilina

A chapter in Operations Research Proceedings 2019, 2020, pp 805-812 from Springer

Abstract: Abstract In this paper, we address the electric bus scheduling problem (EBSP) and its solution. We propose an algorithm for input data reduction which reduces the number of service trips by merging two service trips into one. Also, a method of choosing possible candidates for merging and two different criteria to choose the best candidate are described. Proposed algorithm was tested on real data from the city of Žilina provided by the public transport system operator DPMŽ. After the reduction of the inputs, an exact optimization was performed on the reduced problem to compare the solutions with the original problem.

Keywords: Electric bus; Scheduling problem; Data reduction; IP solver (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-030-48439-2_98

Ordering information: This item can be ordered from
http://www.springer.com/9783030484392

DOI: 10.1007/978-3-030-48439-2_98

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().