Skip to Main Content
This paper presents an algorithm for the scheduling of the movement of escorts which is both simple in implementation and effective in maximizing the use of available time in each escort's schedule. Examining one stationary cache of wheelchairs and a surrounding area assigned to it, we come up with a mathematical model of wheelchair flow in and out of a small region with space for one wheelchair closet. The airport is serviced by a network of caches supplying their surrounding regions exclusively. Adjacent regions are able to share wheelchairs between themselves. Probabilities of passengers needing wheelchairs are used to evaluate wheelchair usage in the average statistical case. Given the implementation of this cache model, we run our algorithm on two simulated airport terminals of different sizes: 100, 200 passengers arriving per cycle.