The Ground-Service-Equipment (GSE) allocation problem considers the efficient allocation of GSEs to the tasks to be performed on an airport apron, taking into account the actual availability of GSEs, the GSE-task compatibilities as well as the distances to be covered by GSEs (allocation costs). The problem has been stated in the context of the AAS project, a research funded by the European Commission and aiming at supporting airport ground service operations with advanced technology and algorithms. The procedure to solve the problem has to be integrated in a decision support system operating in a real-time environment, and the available running time is very small. We describe a constructive heuristic that allocates a GSE to one task at each iteration. This allocation is able to take into account the requirements of all the relevant following tasks, thanks to a network representation of the involved tasks, GSEs and related allocation costs. The GSE allocation procedure has been implemented and preliminarily tested on some randomly generated instances of realistic size. Results show that computational time is very small (in the order of a few seconds for these preliminary examples), hence confirming the applicability of the proposed approach to support the real time dispatching of groundside operations.

Airport Ground Service Equipment Allocation

ANDREATTA, GIOVANNI;DE GIOVANNI, LUIGI;CAPANNA, LORENZO;MONACI, MICHELE;RIGHI, LUCA
2009

Abstract

The Ground-Service-Equipment (GSE) allocation problem considers the efficient allocation of GSEs to the tasks to be performed on an airport apron, taking into account the actual availability of GSEs, the GSE-task compatibilities as well as the distances to be covered by GSEs (allocation costs). The problem has been stated in the context of the AAS project, a research funded by the European Commission and aiming at supporting airport ground service operations with advanced technology and algorithms. The procedure to solve the problem has to be integrated in a decision support system operating in a real-time environment, and the available running time is very small. We describe a constructive heuristic that allocates a GSE to one task at each iteration. This allocation is able to take into account the requirements of all the relevant following tasks, thanks to a network representation of the involved tasks, GSEs and related allocation costs. The GSE allocation procedure has been implemented and preliminarily tested on some randomly generated instances of realistic size. Results show that computational time is very small (in the order of a few seconds for these preliminary examples), hence confirming the applicability of the proposed approach to support the real time dispatching of groundside operations.
2009
Proceedings of the "European Working Group on Transportation EWGT2009"
9788897385202
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2439126
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact