the efficiency of taxiing process has become an important factor that restricts the full use of airport runway *** paper investigates the taxiway planning *** from existing related literatures which do not consider th...
详细信息
the efficiency of taxiing process has become an important factor that restricts the full use of airport runway *** paper investigates the taxiway planning *** from existing related literatures which do not consider the runway exit selecting problem,the significance of runway exit selection for landing aircrafts is *** propose a new conception,Runway Exit Availability(REA),to measure the probability that a flight clear the runway from a specific *** with REA,we can assign a proper exit to each landing ***,we construct a time-space network for the airport taxiing system.A mixed integerprogramming model based on this network is proposed for the assignment of 4D taxiing trajectories- routes and *** taxiway operations of Beijing Capital international Airport as the testing background,experimental analysis shows that,the scheduling result by considering runway exit selection is superior to the result when exit selection is not considered and the calculation time of the scheduling process is acceptable for application in real systems.
this paper aims at solving a stochastic shortest path *** objective is to determine an optimal path which maximizes the probability of arriving on time given a time constraint(i.e.,a deadline).To solve this problem,we...
详细信息
this paper aims at solving a stochastic shortest path *** objective is to determine an optimal path which maximizes the probability of arriving on time given a time constraint(i.e.,a deadline).To solve this problem,we propose a data-driven *** first reformulate the original finding optimal path problem as a cardinality minimization ***,we apply an L1 norm minimization technique to solve the cardinality *** problem is transformed into a mix integer linear programming problem,which can be solved using standard *** proposed approach has three advantages over the traditional methods:(1) the proposed approach can handle various or even unknown travel time distributions,while traditional stochastic routing algorithms can only work on specified distributions;(2) the proposed approach does not rely on the assumption that the travel time on different road segments is independent from each other;(3) unlike other existing approaches which require that the deadline must be larger than a certain value,the proposed approach can support more flexible deadline *** we test our approach respectively on artificial and real-world road networks,the experimental results show that the proposed approach can achieve a comparatively high accuracy when the sampling size of travel time is large ***,under some reasonable assumptions,the accuracy could be 100%.
暂无评论