Please use this identifier to cite or link to this item: https://hdl.handle.net/11499/5172
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCeylan, Halim-
dc.contributor.authorBell, M.G.H.-
dc.date.accessioned2019-08-16T11:42:27Z
dc.date.available2019-08-16T11:42:27Z
dc.date.issued2004-
dc.identifier.issn0191-2615-
dc.identifier.urihttps://hdl.handle.net/11499/5172-
dc.identifier.urihttps://doi.org/10.1016/S0191-2615(03)00015-8-
dc.description.abstractThe genetic algorithm approach to solve traffic signal control and traffic assignment problem is used to tackle the optimisation of signal timings with stochastic user equilibrium link flows. Signal timing is defined by the common network cycle time, the green time for each signal stage, and the offsets between the junctions. The system performance index is defined as the sum of a weighted linear combination of delay and number of stops per unit time for all traffic streams, which is evaluated by the traffic model of TRANSYT [User guide to TRANSYT, version 8, TRRL Report LR888, Transport and Road Research Laboratory, Crowthorne, 1980]. Stochastic user equilibrium assignment is formulated as an equivalent minimisation problem and solved by way of the Path Flow Estimator (PFE). The objective function adopted is the network performance index (PI) and its use for the Genetic Algorithm (GA) is the inversion of the network PI, called the fitness function. By integrating the genetic algorithms, traffic assignment and traffic control, the GATRANSPFE (Genetic Algorithm, TRANSYT and the PFE), solves the equilibrium network design problem. The performance of the GATRANSPFE is illustrated and compared with mutually consistent (MC) solution using numerical example. The computation results show that the GA approach is efficient and much simpler than previous heuristic algorithm. Furthermore, results from the test road network have shown that the values of the performance index were significantly improved relative to the MC. © 2003 Elsevier Ltd. All right reserved.en_US
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.relation.ispartofTransportation Research Part B: Methodologicalen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectComputational methodsen_US
dc.subjectGenetic algorithmsen_US
dc.subjectHeuristic methodsen_US
dc.subjectIntegrationen_US
dc.subjectOptimizationen_US
dc.subjectProblem solvingen_US
dc.subjectRandom processesen_US
dc.subjectResearchen_US
dc.subjectRoutersen_US
dc.subjectSignal theoryen_US
dc.subjectTraffic signalsen_US
dc.subjectSignal timingsen_US
dc.subjectSystem performanceen_US
dc.subjectTransportationen_US
dc.subjectgenetic algorithmen_US
dc.subjectoptimizationen_US
dc.subjecttraffic managementen_US
dc.subjecttravel behavioren_US
dc.titleTraffic signal timing optimisation based on genetic algorithm approach, including drivers' routingen_US
dc.typeArticleen_US
dc.identifier.volume38en_US
dc.identifier.issue4en_US
dc.identifier.startpage329
dc.identifier.startpage329en_US
dc.identifier.endpage342en_US
dc.authorid0000-0002-4616-5439-
dc.identifier.doi10.1016/S0191-2615(03)00015-8-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopus2-s2.0-1542468058en_US
dc.identifier.wosWOS:000220153900003en_US
dc.identifier.scopusqualityQ1-
dc.ownerPamukkale_University-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.languageiso639-1en-
item.grantfulltextnone-
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
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

298
checked on Nov 16, 2024

WEB OF SCIENCETM
Citations

227
checked on Nov 22, 2024

Page view(s)

52
checked on Aug 24, 2024

Google ScholarTM

Check




Altmetric


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