Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Passenger Routing Algorithm for COVID-19 Spreading Prevention by Minimising Overcrowding

Version 1 : Received: 26 December 2023 / Approved: 27 December 2023 / Online: 27 December 2023 (10:09:16 CET)

A peer-reviewed article of this Preprint also exists.

Tolikas, D.; Spyrou, E.D.; Kappatos, V. Passenger Routing Algorithm for COVID-19 Spread Prevention by Minimising Overcrowding. Computers 2024, 13, 47. Tolikas, D.; Spyrou, E.D.; Kappatos, V. Passenger Routing Algorithm for COVID-19 Spread Prevention by Minimising Overcrowding. Computers 2024, 13, 47.

Abstract

COVID-19 has become a pandemic which resulted in measures being taken for health and safety of people. The spreading of the disease was particularly evident in indoor spaces, where people tend to get overcrowded. One such place is the airport where a plethora of passengers flow to common places, such as coffee shops, duty free shops as well as toilets and gates. Guiding the passengers to less overcrowded places within the airport may be a solution to less spreading. In this paper we suggest a passenger routing algorithm whereby the passengers are guided to less crowded places by using a weighting factor, which is minimised to accomplish the desired goal. We modeled a number of shops in an airport using the AnyLogic software and we tested the algorithm showing that the exposure time is less with routing and that the people get appropriately spread to the common spaces, thus, preventing overcrowding.

Keywords

routing; weight; COVID-19; overcrowding; virus; passenger

Subject

Computer Science and Mathematics, Computer Science

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.