Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  consider the over-constrained airport gate assignment problem where the number of flights exceeds the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances or connection.  design a greedy algorithm and use a tabu search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions while  devise a new neighborhood search technique, the interval exchange move, which allows us flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiment conducted give good results.
['H. Ding', 'Andrew Lim', 'Brian Rodrigues', 'Yi Zhu']
I am writing a research paper on a idea Aircraft and gate scheduling optimization at airports
[{"from": "human", "value": "I am writing a research paper on a idea Aircraft and gate scheduling optimization at airports"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  consider the over-constrained airport gate assignment problem where the number of flights exceeds the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances or connection.  design a greedy algorithm and use a tabu search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions while  devise a new neighborhood search technique, the interval exchange move, which allows us flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiment conducted give good results."}]