Please use this identifier to cite or link to this item:
Title: Determining on-street parking places in urban road networks using meta-heuristic harmony search algorithm
Authors: Ceylan, H.
Baskan, O.
Ozan, C.
Gulhan, G.
Keywords: Discrete network design problem
Harmony search algorithm
On-street parking
Traffic management
VISUM traffic model
Computer software
Heuristic algorithms
Integer programming
Learning algorithms
Motor transportation
Traffic control
Harmony search algorithms
Traffic model
Roads and streets
Publisher: Springer Verlag
Abstract: This study aims to develop a simulation/optimization model for the solution to the problem of determining on-street parking places in urban road networks. The problem is dealt within the Discrete Network Design (DND) context due to the binary decision variables and the bi-level programming technique is used for the solution of the problem. The upper level represents the determination of on-street parking places while the reaction of drivers’ to the design is handled in user equilibrium manner in the lower level. The upper level problem is formulized as a non-linear mixed integer programming problem and the meta-heuristic Harmony Search (HS) optimization technique is employed for the solution. In the proposed model, VISUM traffic analysis software is utilized as the simulation tool for solving the lower level problem. The performance of the proposed model is tested on Sioux-Falls road network which has widely been used on DND studies in the previous works. Results show that determining optimal or near-optimal on-street parking places may be achieved by using the proposed model. © Springer International Publishing Switzerland 2014.
ISSN: 2194-5357
Appears in Collections:Mimarlık ve Tasarım Fakültesi Koleksiyonu
Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Show full item record

CORE Recommender


checked on May 21, 2024

Page view(s)

checked on May 6, 2024

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.