A Network Flow Formulation of the Location-Scheduling Problem for Electric Vehicle Charge Stations with Incomplete Information

Peter Czimmermann () and Ľuboš Buzna
Additional contact information
Peter Czimmermann: University of Žilina
Ľuboš Buzna: University of Žilina

A chapter in Operations Research Proceedings 2018, 2019, pp 235-241 from Springer

Abstract: Abstract When solving the location-scheduling problems related to the design of a private charging infrastructure for a fleet of electric vehicles, we may encounter a gap between the number of unfeasible vehicles obtained from optimization and the simulation results. The gap is caused by the fact that users of the charging infrastructure make decisions based on less information than is assumed to be available in the optimization algorithms. In our contribution, we show how to model these problems by using the flows in networks. We propose an algorithm that will operate despite the lack of information utilised by the users of the charging infrastructure.

Date: 2019
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-18500-8_30

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

DOI: 10.1007/978-3-030-18500-8_30

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 ().