The airport gate assignment problem with some practical constraints
In this paper, the airport gate assignment problem is considered with some side constraints like fixing or prohibition of flights in a particular gate due to restriction imposed by certain airline, adjacent gate restriction due to some technical constraint, and adjacent gate push time restriction. The pertinent literature review has been covered and the problem is formulated as an integer-programming (IP) formulation with the objective of minimising total walking distances of passengers subject to different constraints relevant to a practical situation. The proposed model can be solved by using any optimisation software with IP option.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 1 (2009)
Issue (Month): 3 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=286|
When requesting a correction, please mention this item's handle: RePEc:ids:injams:v:1:y:2009:i:3:p:315-323. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Graham Langley)
If references are entirely missing, you can add them using this form.