The Over-Constrained Airport Gate Assignment Problem
In this paper, we study the over-constrained airport gate assignment problem where the objectives are to minimize the number of ungated flights and total walking distances or connection times. We first use a greedy algorithm to minimize ungated flights. Exchange moves are employed to facilitate the...
Saved in:
Main Authors: | DING, Huping, LIM, Andrew, RODRIGUES, Brian, ZHU, Yejun |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2005
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/lkcsb_research/2278 https://doi.org/10.1016/j.cor.2003.12.003 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |
相似書籍
-
New Heuristics for Over-Constrained Flight to Gate Assignments
由: DING, Huping, et al.
出版: (2004) -
Airport Gate Scheduling with Time Windows
由: LIM, Andrew, et al.
出版: (2005) -
Solving the teacher assignment problem by two metaheuristics
由: Gunawan, A., et al.
出版: (2014) -
Solving the teacher assignment problem by two metaheuristics
由: Gunawan, A., et al.
出版: (2014) -
Power system network partitioning using tabu search
由: Chang, C.S., et al.
出版: (2014)