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

Christian Schwan () and Martin Strehler ()
Additional contact information
Christian Schwan: Brandenburg University of Technology
Martin Strehler: Brandenburg University of Technology

A chapter in Modeling, Simulation and Optimization of Complex Processes HPSC 2015, 2017, pp 223-234 from Springer

Abstract: 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.

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

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

DOI: 10.1007/978-3-319-67168-0_18

Access Statistics for this chapter

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