Analyzing and Optimizing Pedestrian Flow through a Single Route in a Topological Network
In emergency cases, people are typically recommended to use the shortest route to minimize their travelling time. This recommendation may however not yield the optimal performance in the long run since the route may be over utilized after a certain point of time and this situation eventually causes...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Science Publishing Corporation Inc
2018
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/24916/1/IJET%207%202.14%202018%2043%2047.pdf |
| _version_ | 1825805188718395392 |
|---|---|
| author | Khalid, Ruzelan Mohd Nawawi, Mohd Kamal Baten, Md Azizul Ishak, Nurhanis |
| author_facet | Khalid, Ruzelan Mohd Nawawi, Mohd Kamal Baten, Md Azizul Ishak, Nurhanis |
| author_sort | Khalid, Ruzelan |
| collection | UUM |
| description | In emergency cases, people are typically recommended to use the shortest route to minimize their travelling time. This recommendation may however not yield the optimal performance in the long run since the route may be over utilized after a certain point of time and this situation eventually causes heavy blockages. This paper thus measures the pedestrian flow performance through all available single routes in a topological network based on relevant arrival rates. The performance was measured using an M/G/C/C state dependent queuing approach which dynamically models pedestrians’ walking speed in relation to their current density in a route. The analysis was based on an imaginary network consisting of various routes and topologies. For each route, its performance in terms of the throughput, blocking probability, expected number of pedestrians and expected travel time was first evaluated. The performance was then compared to each other and also compared to the flow performance if all available routes were utilized. The results indicated that the shortest route did not necessarily generate the optimal throughput and that the utilization of all available routes to flow pedestrians generated better performance. The optimal performance could be obtained if the arrival rate was controlled at a certain level. |
| first_indexed | 2024-07-04T06:28:13Z |
| format | Article |
| id | uum-24916 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:28:13Z |
| publishDate | 2018 |
| publisher | Science Publishing Corporation Inc |
| record_format | eprints |
| spelling | uum-249162018-12-19T00:30:24Z https://repo.uum.edu.my/id/eprint/24916/ Analyzing and Optimizing Pedestrian Flow through a Single Route in a Topological Network Khalid, Ruzelan Mohd Nawawi, Mohd Kamal Baten, Md Azizul Ishak, Nurhanis QA76 Computer software In emergency cases, people are typically recommended to use the shortest route to minimize their travelling time. This recommendation may however not yield the optimal performance in the long run since the route may be over utilized after a certain point of time and this situation eventually causes heavy blockages. This paper thus measures the pedestrian flow performance through all available single routes in a topological network based on relevant arrival rates. The performance was measured using an M/G/C/C state dependent queuing approach which dynamically models pedestrians’ walking speed in relation to their current density in a route. The analysis was based on an imaginary network consisting of various routes and topologies. For each route, its performance in terms of the throughput, blocking probability, expected number of pedestrians and expected travel time was first evaluated. The performance was then compared to each other and also compared to the flow performance if all available routes were utilized. The results indicated that the shortest route did not necessarily generate the optimal throughput and that the utilization of all available routes to flow pedestrians generated better performance. The optimal performance could be obtained if the arrival rate was controlled at a certain level. Science Publishing Corporation Inc 2018 Article PeerReviewed application/pdf en cc_by https://repo.uum.edu.my/id/eprint/24916/1/IJET%207%202.14%202018%2043%2047.pdf Khalid, Ruzelan and Mohd Nawawi, Mohd Kamal and Baten, Md Azizul and Ishak, Nurhanis (2018) Analyzing and Optimizing Pedestrian Flow through a Single Route in a Topological Network. International Journal of Engineering & Technology, 7 (2.14). pp. 43-47. ISSN 2227-524X http://www.sciencepubco.com/index.php/ijet/article/view/11155 |
| spellingShingle | QA76 Computer software Khalid, Ruzelan Mohd Nawawi, Mohd Kamal Baten, Md Azizul Ishak, Nurhanis Analyzing and Optimizing Pedestrian Flow through a Single Route in a Topological Network |
| title | Analyzing and Optimizing Pedestrian Flow through a Single Route in a Topological Network |
| title_full | Analyzing and Optimizing Pedestrian Flow through a Single Route in a Topological Network |
| title_fullStr | Analyzing and Optimizing Pedestrian Flow through a Single Route in a Topological Network |
| title_full_unstemmed | Analyzing and Optimizing Pedestrian Flow through a Single Route in a Topological Network |
| title_short | Analyzing and Optimizing Pedestrian Flow through a Single Route in a Topological Network |
| title_sort | analyzing and optimizing pedestrian flow through a single route in a topological network |
| topic | QA76 Computer software |
| url | https://repo.uum.edu.my/id/eprint/24916/1/IJET%207%202.14%202018%2043%2047.pdf |
| work_keys_str_mv | AT khalidruzelan analyzingandoptimizingpedestrianflowthroughasinglerouteinatopologicalnetwork AT mohdnawawimohdkamal analyzingandoptimizingpedestrianflowthroughasinglerouteinatopologicalnetwork AT batenmdazizul analyzingandoptimizingpedestrianflowthroughasinglerouteinatopologicalnetwork AT ishaknurhanis analyzingandoptimizingpedestrianflowthroughasinglerouteinatopologicalnetwork |