论文部分内容阅读
调度问题考虑的是随着时间的变化,如何调度有限的资源在执行任务的同时满足特定约束。停机位分配问题就是按照一定的限制条件为进入机坪的每一架到场飞机分配停机位,限制条件包括:机型大小、停场时间、突发状况等。调度问题从本质上讲非常复杂,难以用传统优化方法求解。通常这些问题都属于满足非常复杂约束的组合优化问题,这些问题带有有限数量的可行解,属于NP问题。传统方法很难计算NP问题,很多研究表明,寻找NP
Scheduling problem to consider is that over time, how to schedule a limited resources in the implementation of tasks at the same time meet specific constraints. Parking allocation problem is in accordance with certain restrictions for each aircraft entering the apron assigned parking spaces, restrictions include: size, stop time, unexpected conditions. Scheduling problem is very complex in nature, it is difficult to use traditional optimization methods to solve. Usually these problems are all combinatorial optimization problems that satisfy very complicated constraints. These problems have a limited number of feasible solutions and belong to the NP problem. The traditional method is difficult to calculate the NP problem, many studies show that looking for NP