Please use this identifier to cite or link to this item:
Title: Determining optimal link capacity expansions in road networks using cuckoo search algorithm with Lévy flights
Authors: Başkan, Özgür
Abstract: During the last two decades, Continuous Network Design Problem (CNDP) has received much more attention because of increasing trend of traffic congestion in road networks. In the CNDP, the problem is to find optimal link capacity expansions by minimizing the sum of total travel time and investment cost of capacity expansions in a road network. Considering both increasing traffic congestion and limited budgets of local authorities, the CNDP deserves to receive more attention in order to use available budget economically and to mitigate traffic congestion. The CNDP can generally be formulated as bilevel programming model in which the upper level deals with finding optimal link capacity expansions, whereas at the lower level, User Equilibrium (UE) link flows are determined by Wardrop's first principle. In this paper, cuckoo search (CS) algorithm with Lévy flights is introduced for finding optimal link capacity expansions because of its recent successful applications in solving such complex problems. CS is applied to the 16-link and Sioux Falls networks and compared with available methods in the literature. Results show the potential of CS for finding optimal or near optimal link capacity expansions in a given road network. © 2013 Ozgur Baskan.
ISSN: 1110-757X
Appears in Collections:Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File SizeFormat 
718015.pdf2.15 MBAdobe PDFView/Open
Show full item record

CORE Recommender


checked on May 21, 2024


checked on May 14, 2024

Page view(s)

checked on May 6, 2024


checked on May 6, 2024

Google ScholarTM



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