1-2hit |
Kenji UEHARA Kunihiko HIRAISHI
In this paper, we present a framework for composing discrete-event simulation models from a large amount of airspace traffic data without using any specific waypoints. The framework consists of two parts. In the first part, abstracted route graphs that indicate representative routes in the airspace are composed. We propose two methods for extracting important routes in the form of graphs based on combination of various technologies such as space partition, trajectory clustering, and skeleton extraction. In the second part, discrete-event simulation models are composed based on statistical information on flight time along each edge of the abstracted route graph. The composed simulation models have intermediate granularity between micro models, such as multi-agent simulation, and macro models, such as queuing models, and therefore they should be classified as mesoscopic models. Finally, we show numerical results to evaluate the accuracy of the simulation model.
Kenji UEHARA Kunihiko HIRAISHI Kokolo IKEDA
Boarding is the last step of aircraft turnaround and its completion in the shortest possible time is desired. In this paper, we propose a new boarding strategy that outperforms conventional strategies such as the back-to-front strategy and the outside-in strategy. The Steffen method is known as one of the most efficient boarding strategies in literature, but it is hard to be realized in the real situation because the complete sorting of passengers in a prescribed order is required. The proposed strategy shows a performance close to that of the Steffen method and can be easily implemented by using a special gate system.