<div class="csl-bib-body">
<div class="csl-entry">Jatschka, T., Rauscher, M., Kreutzer, B., Okamoto, Y., Kataoka, H., Rodemann, T., & Raidl, G. R. (2022). A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters. In R. Moreno-Díaz, F. Pichler, & A. Quesada-Arencibia (Eds.), <i>Computer Aided Systems Theory – EUROCAST 2022 : 18th International Conference, Las Palmas de Gran Canaria, Spain, February 20–25, 2022, Revised Selected Papers</i> (pp. 121–129). Springer. https://doi.org/10.1007/978-3-031-25312-6_14</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/191300
-
dc.description.abstract
We consider the Multi Objective Battery Swapping Station Location Problem (MOBSSLP) for planning the setup of new stations for exchanging depleted batteries of electric scooters with the aim of minimizing a three-part objective function while satisfying an expected amount of demand. Batteries returned at a station are charged and provided to customers again once they are full. We present a large neighborhood search (LNS) for solving MOBSSLP instances. The LNS makes use of a mixed integer linear program (MILP) to quickly find good solutions within a specified neighborhood. Multiple neighborhood structures given by pairs of destroy and repair operators are suggested. The proposed LNS is evaluated on instances generated by adapted approaches from the literature with up to 500 potential station locations and up to 1000 user trips. Solutions obtained from the LNS have on average ten to thirty percent better objective values on these instances than a state-of-the-art MILP solver.
en
dc.language.iso
en
-
dc.relation.ispartofseries
Lecture Notes in Computer Science
-
dc.subject
Battery swapping stations
en
dc.subject
Facility location problem
en
dc.subject
Large neighborhood search
en
dc.subject
Mixed integer linear programming
en
dc.title
A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.contributor.affiliation
Honda R &D, Japan
-
dc.contributor.affiliation
Honda R &D, Japan
-
dc.contributor.affiliation
Honda Research Institute Europe GmbH, Germany
-
dc.relation.isbn
978-3-031-25311-9
-
dc.description.startpage
121
-
dc.description.endpage
129
-
dc.type.category
Full-Paper Contribution
-
tuw.booktitle
Computer Aided Systems Theory – EUROCAST 2022 : 18th International Conference, Las Palmas de Gran Canaria, Spain, February 20–25, 2022, Revised Selected Papers
-
tuw.container.volume
13789
-
tuw.peerreviewed
true
-
tuw.relation.publisher
Springer
-
tuw.relation.publisherplace
Cham
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.publisher.doi
10.1007/978-3-031-25312-6_14
-
dc.description.numberOfPages
9
-
tuw.author.orcid
0000-0003-2501-7039
-
tuw.author.orcid
0000-0002-4686-4678
-
tuw.author.orcid
0000-0001-6256-0060
-
tuw.author.orcid
0000-0002-3293-177X
-
tuw.event.name
Eurocast 2022. 18th International Conference on Computer Aided Systems Theory
en
tuw.event.startdate
20-02-2022
-
tuw.event.enddate
25-02-2022
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Las Palmas de Gran Canaria
-
tuw.event.country
ES
-
tuw.event.presenter
Jatschka, Thomas
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.cerifentitytype
Publications
-
item.openairetype
conference paper
-
item.languageiso639-1
en
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.fulltext
no Fulltext
-
item.grantfulltext
restricted
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
Honda R &D, Japan
-
crisitem.author.dept
Honda R &D, Japan
-
crisitem.author.dept
Honda Research Institute Europe GmbH, Germany
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity