<div class="csl-bib-body">
<div class="csl-entry">Kloimüllner, C. (2019). <i>Algorithmic approaches for Optimization problems in bike sharing and security control</i> [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.25373</div>
</div>
-
dc.identifier.uri
https://doi.org/10.34726/hss.2019.25373
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/5349
-
dc.description.abstract
Most public-bike sharing systems consist of rental stations distributed among a city. These systems are designed for short-term use and single trips, i.e., bikes can be rent and returned at any station in the system. Thus, the problem of rebalancing the system arises, which is denoted as balancing bike sharing system problem. This problem is addressed with various (meta)heuristics and exact methods within this thesis. Moreover, when planning a new system or extending an existing one, the problem of selecting appropriate locations and con gurations for stations arises. Hereby, budget restrictions and other constraints need to be considered and the expected user bene t should be maximized. This problem is referred to as the bike sharing station planning problem. In practice, large instances of this problem must be solved, and it is necessary to come up with a solution method that is able to \overlook the problem as a whole" | classical local-search methods or basic greedy construction methods would not be meaningful. We propose a solution method based on the multilevel re nement paradigm, which utilizes a hierarchically clustered input data. The third combinatorial optimization problem considered in this thesis is the Districting and Routing Problem for Security Control. The optimization goal is to minimize the number of routes that are necessary to perform speci ed visits of buildings. To this end, we propose a smart district elimination algorithm. Lastly, we also study this problem with soft time windows and suggest a fast hybrid heuristic based on dynamic programming, which can frequently yield proven optimal solutions in short times.
en
dc.language
English
-
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
operations research
en
dc.subject
combinatorial optimization
en
dc.subject
bike sharing
en
dc.subject
security control
en
dc.subject
vehicle routing problem
en
dc.subject
facility location problem
en
dc.subject
logic-based Benders decomposition
en
dc.subject
variable neighborhood search
en
dc.subject
greedy randomized adaptive search procedure
en
dc.subject
multilevel refinement
en
dc.title
Algorithmic approaches for Optimization problems in bike sharing and security control
en
dc.type
Thesis
en
dc.type
Hochschulschrift
de
dc.rights.license
In Copyright
en
dc.rights.license
Urheberrechtsschutz
de
dc.identifier.doi
10.34726/hss.2019.25373
-
dc.contributor.affiliation
TU Wien, Österreich
-
dc.rights.holder
Christian Kloimüllner
-
dc.publisher.place
Wien
-
tuw.version
vor
-
tuw.thesisinformation
Technische Universität Wien
-
tuw.publication.orgunit
E192 - Institut für Logic and Computation
-
dc.type.qualificationlevel
Doctoral
-
dc.identifier.libraryid
AC15329366
-
dc.description.numberOfPages
206
-
dc.identifier.urn
urn:nbn:at:at-ubtuw:1-122593
-
dc.thesistype
Dissertation
de
dc.thesistype
Dissertation
en
dc.rights.identifier
In Copyright
en
dc.rights.identifier
Urheberrechtsschutz
de
tuw.advisor.staffStatus
staff
-
tuw.advisor.orcid
0000-0002-3293-177X
-
item.fulltext
with Fulltext
-
item.cerifentitytype
Publications
-
item.mimetype
application/pdf
-
item.openairecristype
http://purl.org/coar/resource_type/c_db06
-
item.languageiso639-1
en
-
item.openaccessfulltext
Open Access
-
item.openairetype
doctoral thesis
-
item.grantfulltext
open
-
crisitem.author.dept
E186 - Institut für Computergraphik und Algorithmen