Optimal routing of pedestrian flow in a complex topological network with multiple entrances and exits

Basit Öğe Kaydı
dc.authoridhttp://orcid.org/0000-0002-4283-0737en_US
dc.authoridhttp://orcid.org/0000-0003-4447-9941en_US
dc.authoridhttp://orcid.org/0000-0002-8010-6379en_US
dc.authoridhttp://orcid.org/0000-0001-5410-812Xen_US
dc.authoridhttp://orcid.org/0000-0003-0989-674Xen_US
dc.contributor.authorKhalid, Ruzelan
dc.contributor.authorNawawi, Mohd Kamal Mohd
dc.contributor.authorKawsar, Luthful Alahi
dc.contributor.authorGhani, Noraida Abdul
dc.contributor.authorKamil, Anton Abdulbasah
dc.contributor.authorMustafa, Adli
dc.date.accessioned2023-09-11T20:15:23Z
dc.date.available2023-09-11T20:15:23Z
dc.date.issued2020en_US
dc.departmentİktisadi İdari ve Sosyal Bilimler Fakültesien_US
dc.description.abstractA real-world topological network consists of multiple entrances along its source nodes. Routing appropriate percentages of pedestrians from these entrances to the particular available routes with relevant arrival rates will improve the network’s performance. This paper presents a framework for finding the optimal arrival rates of pedestrians from all available entrances and routes to downstream nodes maximising the network’s throughput. The calculation of the arrival rates and movement directions is based on M/G/C/C analytical and simulation models and the network flow model and considers the real distances of the entrances along the source nodes. The framework was tested on the Tuanku Syed Putra Hall, Universiti Sains Malaysia, Malaysia. Extensive analyses of the performances of its available nodes especially on the achievable optimal throughputs were documented and discussed. Quantitative results show that the hall’s throughput is optimised when pedestrians’ arrival rates to all the available entrances and their movement directions are controlled within certain ranges.en_US
dc.identifier.doi10.1080/00207721.2020.1756524en_US
dc.identifier.endpage1352en_US
dc.identifier.issn0020-7721
dc.identifier.issn1464-5319
dc.identifier.issue8en_US
dc.identifier.scopus2-s2.0-85085042430en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage1325en_US
dc.identifier.urihttps://hdl.handle.net/11363/5493
dc.identifier.urihttps://doi.org/
dc.identifier.volume51en_US
dc.identifier.wosWOS:000534159100001en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorKamil, Anton Abdulbasah
dc.language.isoenen_US
dc.publisherTAYLOR & FRANCIS LTD, 2-4 PARK SQUARE, MILTON PARK, ABINGDON OR14 4RN, OXON, ENGLANDen_US
dc.relation.ispartofInternational Journal of Systems Scienceen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectM/G/C/Cen_US
dc.subjectnetwork flow modelen_US
dc.subjectsimulationen_US
dc.subjectfacilities planning and designen_US
dc.subjectqueuing networksen_US
dc.titleOptimal routing of pedestrian flow in a complex topological network with multiple entrances and exitsen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
Optimal routing of pedestrian flow in a complex topological network with multiple entrances and exits.pdf
Boyut:
4.86 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale / Article
İndir
Lisans paketi
Listeleniyor 1 - 1 / 1
[ N/A ]
İsim:
license.txt
Boyut:
1.56 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
İndir

Koleksiyon

Web of Science ve Scopus Atıf Dizinlerindeki Yayınlar
Scopus İndeksli Yayınlar Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu