IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-67168-0_18.html

Two FPTAS for the Constrained Shortest Path Problem Applied to Hybrid Vehicle Routing

In: Modeling, Simulation and Optimization of Complex Processes HPSC 2015

Author

Listed:
  • Christian Schwan

    (Brandenburg University of Technology)

  • Martin Strehler

    (Brandenburg University of Technology)

Abstract

We consider a constrained shortest path problem with two resources. These two resources can be converted into each other in a particular manner. Our practical application is the energy optimal routing of hybrid vehicles. Due to the possibility of converting fuel into electric energy this setting adds new characteristics and new combinatorial possibilities to the common constrained shortest path problem (CSP). We formulate the resulting problem as a generalization of CSP. We show that optimal paths in this model may contain cycles and we state conditions to prevent them. The main contribution is a polynomial-time approximation scheme and a simpler approximation algorithm for computing energy-optimal paths in graphs.

Suggested Citation

  • Christian Schwan & Martin Strehler, 2017. "Two FPTAS for the Constrained Shortest Path Problem Applied to Hybrid Vehicle Routing," Springer Books, in: Hans Georg Bock & Hoang Xuan Phu & Rolf Rannacher & Johannes P. Schlöder (ed.), Modeling, Simulation and Optimization of Complex Processes HPSC 2015, pages 223-234, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-67168-0_18
    DOI: 10.1007/978-3-319-67168-0_18
    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
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    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:sprchp:978-3-319-67168-0_18. 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.