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 |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2278 https://doi.org/10.1016/j.cor.2003.12.003 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
New Heuristics for Over-Constrained Flight to Gate Assignments
by: DING, Huping, et al.
Published: (2004) -
Airport Gate Scheduling with Time Windows
by: LIM, Andrew, et al.
Published: (2005) -
Solving the teacher assignment problem by two metaheuristics
by: Gunawan, A., et al.
Published: (2014) -
Solving the teacher assignment problem by two metaheuristics
by: Gunawan, A., et al.
Published: (2014) -
A Hybrid Framework for Over-Constrained Generalized Resource-Constrained Project Scheduling Problems
by: LIM, Andrew, et al.
Published: (2010)