Advanced Search
MyIDEAS: Login to save this paper or follow this series

Metaheuristic algorithms for the simultaneous slot allocation problem

Contents:

Author Info

  • Paola Pellegrini

    ()
    (IRIDIA-CoDE, Universite Libre de Bruxelles)

  • Lorenzo Castelli

    ()
    (Dipartimento di Ingegneria Industriale e dell'Informazione, Università di Trieste)

  • Raffaele Pesenti

    ()
    (Department of Management, Università Ca' Foscari Venezia)

Abstract

In this paper, we formalize the simultaneous slot allocation problem. It is an extension of the problem currently tackled for allocating airport slots: it deals with all airports simultaneously and it enforces the respect of airspace sector capacities. By solving this novel problem, the system may overcome some major inefficiencies that characterize the current slot allocation process. We tackle the simultaneous slot allocation problem with two algorithms based on metaheuristics, namely Iterated Local Search and Variable Neighborhood Search, and with an integer linear programming model: for each of these three algorithms, we allow a fixed computation time, and we take the best solution found during that time as the final solution. We compare these algorithms on randomly generated instances, and we show that, when small instances are to be tackled, metaheuristics are competitive with the exact model. When medium or large instances are to be tackled, the exact model suffers some major issues in terms of memory and computation time requirements. Metaheuristics, instead, can deal with very large instances, achieving very high quality results.

Download Info

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.
File URL: http://virgo.unive.it/wpideas/storage/2011wp9.pdf
File Function: First version, 2011
Download Restriction: no

Bibliographic Info

Paper provided by Department of Management, Università Ca' Foscari Venezia in its series Working Papers with number 9.

as in new window
Length: 41 pages
Date of creation: Oct 2011
Date of revision:
Handle: RePEc:vnm:wpdman:9

Contact details of provider:
Web page: http://www.unive.it/dip.management
More information through EDIRC

Related research

Keywords: Air Traffic Management; Airport slot allocation; Metaheuristics; Integer linear programming;

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Verhoef, Erik T., 2010. "Congestion pricing, slot sales and slot trading in aviation," Transportation Research Part B: Methodological, Elsevier, vol. 44(3), pages 320-329, March.
  2. Lorenzo Castelli & Paola Pellegrini & Raffaele Pesenti, 2010. "Airport slot allocation in Europe: economic efficiency and fairness," Working Papers 197, Department of Applied Mathematics, Università Ca' Foscari Venezia.
  3. Starkie, David, 1998. "Allocating airport slots: a role for the market?," Journal of Air Transport Management, Elsevier, vol. 4(2), pages 111-116.
  4. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:vnm:wpdman:9. 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: (Marco LiCalzi).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.