本文讨论了如何利用线性规划解决飞机航班调度问题，以确保避免碰撞并最大化降落时间间隔。通过建立线性规划模型，并给出4架飞机的具体时间窗口例子，使用GLPK求解器得出最优解。
线性规划之飞机航班调度问题
1.Problem : Airplane Landing Problem
With human lives at stake, an air traffic controller has to schedule the airplanes that are landing at an airport in order to avoid airplane collision. Each airplane i has a time window [si,ti] during which it can safely land. You must compute the exact time of landing for each airplane that respects these time windows. Furthermore, the airplane landings should be stretched out as much as possible so that the minimum time gap between successive landings is as large as possible.
For example, if the time window of landing three airplanes are [10:00−11:00],[11:20−11:40
最低0.47元/天 解锁文章
3042
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
