IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-48439-2_98.html
   My bibliography  Save this book chapter

Data Reduction Algorithm for the Electric Bus Scheduling Problem

In: Operations Research Proceedings 2019

Author

Listed:
  • Maros Janovec

    (University of Zilina)

  • Michal Kohani

    (University of Zilina)

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.

Suggested Citation

  • Maros Janovec & Michal Kohani, 2020. "Data Reduction Algorithm for the Electric Bus Scheduling Problem," Operations Research Proceedings, in: Janis S. Neufeld & Udo Buscher & Rainer Lasch & Dominik Möst & Jörn Schönberger (ed.), Operations Research Proceedings 2019, pages 805-812, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-48439-2_98
    DOI: 10.1007/978-3-030-48439-2_98
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-030-48439-2_98. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.