| |
| The development of the air traffic system and the awareness of the protection of the rights for inconvenient people lead to the demand for wheelchair arrangement in airports. Aiming at minimizing the expense of the costs for sustaining the wheelchair service, we give a simulation model and constructed a model based on a gate to gate process.
By detailed analysis we abstract the core model as a “gate to gate” problem with a given schedule and thus the question is to determine the wheelchair number and the dispatch strategy.
Building state transition model and combining a skill of bipartite graph match algorithm we create a method for determine the wheelchair number. Specially, when the airport follows a centralized shape we also provide a quicker and more accurate traverse search algorithm with an O(n) time complexity.
Our dispatching strategy is to get a longest event sequence in which no wheelchair would be free and we program in that period using depth-first-search algorithm to approximating the best strategy.
Based on the prime models, we considered situation when waiting time for boarding is extremely long and customer would randomly ask for service. We abstract the concourse to a special gate to fulfill our model while implement a random service model solved by binomial distribution knowledge for the random service.
By computer simulation we get concrete dispatching schedule and analyze the effect of factors as concourse numbers, service-needed population, traffic load and get a conclude that our model is universal and effective under varied circumstance. Further, our program show a cooperating between companies would enable every company to a 50% less need as the most.
Our data gives a formula which enables one company to calculate the future wheelchair needed.
|
|
| Keywords:wheelchair service, airports, unconvinient people |
|
