Essec\Faculty\Model\Contribution {#2216
#_index: "academ_contributions"
#_id: "12002"
#_source: array:26 [
"id" => "12002"
"slug" => "location-of-charging-stations-in-electric-car-sharing-systems"
"yearMonth" => "2020-09"
"year" => "2020"
"title" => "Location of Charging Stations in Electric Car Sharing Systems"
"description" => "BRANDSTÄTTER, G., LEITNER, M. et LJUBIC, I. (2020). Location of Charging Stations in Electric Car Sharing Systems. <i>Transportation Science</i>, 54(5), pp. 1408-1438."
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "BRANDSTÄTTER Georg"
]
2 => array:1 [
"name" => "LEITNER Markus"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "green logistics, location analysis, electric vehicles, car sharing, charging station location, integer linear programming"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1287/trsc.2019.0931"
"publicationInfo" => array:3 [
"pages" => "1408-1438"
"volume" => "54"
"number" => "5"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Electric vehicles are prime candidates for use within urban car sharing systems, both from economic and environmental perspectives. However, their relatively short range necessitates frequent and rather time-consuming recharging throughout the day. Thus, charging stations must be built throughout the system’s operational area where cars can be charged between uses. In this work, we introduce and study an optimization problem that models the task of finding optimal locations and sizes for charging stations, using the number of expected trips that can be accepted (or their resulting revenue) as a gauge of quality. Integer linear programming formulations and construction heuristics are introduced, and the resulting algorithms are tested on grid-graph-based instances, as well as on real-world instances from Vienna. The results of our computational study show that the best-performing exact algorithm solves most of the benchmark instances to optimality and usually provides small optimality gaps for the remaining ones, whereas our heuristics provide high-quality solutions very quickly. Our algorithms also provide better solutions than a sequential approach that considers strategic and operational decisions separately. A cross-validation study analyzes the algorithms’ performance in cases where demand is uncertain and shows the advantage of combining individual solutions into a single consensus solution, and a simulation study investigates their behavior in car sharing systems that provide their customers with more flexibility regarding vehicle selection."
"en" => "Electric vehicles are prime candidates for use within urban car sharing systems, both from economic and environmental perspectives. However, their relatively short range necessitates frequent and rather time-consuming recharging throughout the day. Thus, charging stations must be built throughout the system’s operational area where cars can be charged between uses. In this work, we introduce and study an optimization problem that models the task of finding optimal locations and sizes for charging stations, using the number of expected trips that can be accepted (or their resulting revenue) as a gauge of quality. Integer linear programming formulations and construction heuristics are introduced, and the resulting algorithms are tested on grid-graph-based instances, as well as on real-world instances from Vienna. The results of our computational study show that the best-performing exact algorithm solves most of the benchmark instances to optimality and usually provides small optimality gaps for the remaining ones, whereas our heuristics provide high-quality solutions very quickly. Our algorithms also provide better solutions than a sequential approach that considers strategic and operational decisions separately. A cross-validation study analyzes the algorithms’ performance in cases where demand is uncertain and shows the advantage of combining individual solutions into a single consensus solution, and a simulation study investigates their behavior in car sharing systems that provide their customers with more flexibility regarding vehicle selection."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2024-12-21T16:21:43.000Z"
"docTitle" => "Location of Charging Stations in Electric Car Sharing Systems"
"docSurtitle" => "Journal articles"
"authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, BRANDSTÄTTER Georg, LEITNER Markus"
"docDescription" => "<span class="document-property-authors">LJUBIC Ivana, BRANDSTÄTTER Georg, LEITNER Markus</span><br><span class="document-property-authors_fields">Information Systems, Data Analytics and Operations</span> | <span class="document-property-year">2020</span>"
"keywordList" => "<a href="#">green logistics, location analysis, electric vehicles, car sharing, charging station location, integer linear programming</a>"
"docPreview" => "<b>Location of Charging Stations in Electric Car Sharing Systems</b><br><span>2020-09 | Journal articles </span>"
"docType" => "research"
"publicationLink" => "<a href="https://doi.org/10.1287/trsc.2019.0931" target="_blank">Location of Charging Stations in Electric Car Sharing Systems</a>"
]
+lang: "en"
+"_type": "_doc"
+"_score": 8.755391
+"parent": null
}