Metaheuristic algorithms for the simultaneous slot allocation problem
AbstractIn 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 InfoIf 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.
Bibliographic InfoPaper provided by Department of Management, Università Ca' Foscari Venezia in its series Working Papers with number 9.
Length: 41 pages
Date of creation: Oct 2011
Date of revision:
Air Traffic Management; Airport slot allocation; Metaheuristics; Integer linear programming;
This paper has been announced in the following NEP Reports:
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.:
- 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.
- 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.
- Erik T. Verhoef, 2008. "Congestion Pricing, Slot Sales and Slot Trading in Aviation," Tinbergen Institute Discussion Papers 08-030/3, Tinbergen Institute.
- 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.
- Starkie, David, 1998. "Allocating airport slots: a role for the market?," Journal of Air Transport Management, Elsevier, vol. 4(2), pages 111-116.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Marco LiCalzi).
If references are entirely missing, you can add them using this form.