Stanchion System Design for Queue Managemen
dc.contributor.advisor | Andrwes, James | |
dc.contributor.author | Sharahili, Waleed | |
dc.date.accessioned | 2024-11-03T06:47:12Z | |
dc.date.issued | 2024-09-21 | |
dc.description.abstract | This study examines the optimization of queue management systems, focusing on the efficient design of stanchion placements within grid-based configurations. The primary objective was to identify and analyze optimal queue graph configurations that improve flow efficiency and reduce costs. By systematically exploring all possible queue graphs, a framework was established based on two key metrics: the ratio of nodes to stanchions and the number of turns within the queue. Findings indicate that higher node-to-stanchion ratios with fewer turns create more effective queue designs. Additionally, analysis of sub-belt queue graphs revealed that removing a single belt can uncover all potential flow patterns, enabling dynamic adjustments based on real-time data from occupancy detection sensors. These findings suggest that reducing stanchions can significantly lower design costs while maintaining efficiency. This work also refined manual pathfinding strategies through systematic searches, yielding a practical approach for optimizing queue graph configurations. | |
dc.format.extent | 42 | |
dc.identifier.citation | (Sharahili,2024) | |
dc.identifier.uri | https://hdl.handle.net/20.500.14154/73422 | |
dc.language.iso | en | |
dc.publisher | Universty of Birmingham | |
dc.subject | Queue Management System (QMS) | |
dc.subject | Queue Graph | |
dc.subject | Hamiltonian Path | |
dc.title | Stanchion System Design for Queue Managemen | |
dc.type | Thesis | |
sdl.degree.department | School of Mathematics | |
sdl.degree.discipline | Applied Mathematics | |
sdl.degree.grantor | Universty of Birmingham | |
sdl.degree.name | MSc Applied Mathematics |