Please use this identifier to cite or link to this item: https://hdl.handle.net/11499/10573
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBaşkan, Özgür-
dc.contributor.authorOzan, C.-
dc.contributor.authorDell’orco, M.-
dc.contributor.authorMarinelli, M.-
dc.date.accessioned2019-08-16T13:31:45Z
dc.date.available2019-08-16T13:31:45Z
dc.date.issued2018-
dc.identifier.issn0353-5320-
dc.identifier.urihttps://hdl.handle.net/11499/10573-
dc.identifier.urihttps://doi.org/10.7307/ptt.v30i6.2789-
dc.description.abstractFor a long time, many researchers have investigated the continuous network design problem (CNDP) to distribute equitably additional capacity between selected links in a road network, to overcome traffic congestion in urban roads. In addition, CNDP plays a critical role for local authorities in tackling traffic congestion with a limited budget. Due to the mutual interaction between road users and local authorities, CNDP is usually solved using the bilevel modeling technique. The upper level seeks to find the optimal capacity enhancements of selected links, while the lower level is used to solve the traffic assignment problem. In this study, we introduced the enhanced differential evolution algorithm based on multiple improvement strategies (EDEMIS) for solving CNDP. We applied EDEMIS first to a hypothetical network to show its ability in finding the global optimum solution, at least in a small network. Then, we used a 16-link network to reveal the capability of EDEMIS especially in the case of high demand. Finally, we used the Sioux Falls city network to evaluate the performance of EDEMIS according to other solution methods on a medium-sized road network. The results showed that EDEMIS produces better solutions than other considered algorithms, encouraging transportation planners to use it in large-scale road networks. © 2018, Faculty of Transport and Traffic Engineering. All rights reserved.en_US
dc.language.isoenen_US
dc.publisherFaculty of Transport and Traffic Engineeringen_US
dc.relation.ispartofPromet - Traffic - Trafficoen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectCapacity enhancementen_US
dc.subjectContinuous network designen_US
dc.subjectMutual interactionen_US
dc.subjectUser equilibriumen_US
dc.subjectalgorithmen_US
dc.subjectequilibriumen_US
dc.subjectnetwork designen_US
dc.subjectperformance assessmenten_US
dc.subjectroaden_US
dc.subjecttraffic congestionen_US
dc.subjecturban areaen_US
dc.subjectdesign methoden_US
dc.subjectroad transporten_US
dc.subjecttransportationen_US
dc.subjecturban transporten_US
dc.subjectSioux Fallsen_US
dc.subjectSouth Dakotaen_US
dc.subjectUnited Statesen_US
dc.subjectUlaen_US
dc.titleImproving the performance of the bilevel solution for the continuous network design problemen_US
dc.typeArticleen_US
dc.identifier.volume30en_US
dc.identifier.issue6en_US
dc.identifier.startpage709
dc.identifier.startpage709en_US
dc.identifier.endpage720en_US
dc.identifier.doi10.7307/ptt.v30i6.2789-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopus2-s2.0-85063079054en_US
dc.identifier.wosWOS:000457183100006en_US
dc.identifier.scopusqualityQ2-
dc.ownerPamukkale University-
item.languageiso639-1en-
item.openairetypeArticle-
item.grantfulltextopen-
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.dept10.02. Civil Engineering-
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 
IMPROVING.pdf737.8 kBAdobe PDFView/Open
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

2
checked on Jun 29, 2024

WEB OF SCIENCETM
Citations

2
checked on Jul 2, 2024

Page view(s)

32
checked on May 27, 2024

Download(s)

8
checked on May 27, 2024

Google ScholarTM

Check




Altmetric


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