An improved method for scheduling aircraft ground handling operations from a global perspective

Silvia Padrón, Daniel Guimarans

Research output: Contribution to journalArticleResearchpeer-review

Abstract

The turnaround is a critical airport process where a set of interrelated operations need to be performed to get an aircraft ready for its next flight. These activities are carried out by different vehicles, which need to be coordinated to guarantee an efficient utilization of resources. Due to the relations between operations, the order in which these resources are scheduled has a critical influence on the planning and performance of the turnaround. In this work, we present a novel methodology for solving the proposed bi-objective ground handling scheduling problem from a global perspective. This means solving a set of interconnected routing problems with restrictive time windows for each operation. We first explore the solution space using a fast heuristic, focusing then on the most promising solutions to intensify the search in the vicinity of the Pareto frontier. This two-step schema permits significantly reducing the required computational time, which, in turn, allows a more thorough exploration of solutions. Different experiments over real data from two Spanish airports have been conducted to assess the proposed methodology. Our results show that the new method not only outperforms previous approaches in terms of computational requirements, but can also improve the quality of scheduling solutions.
Original languageEnglish
Article number1950020
Number of pages25
JournalAsia-Pacific Journal of Operational Research
Volume36
Issue number4
DOIs
Publication statusPublished - 2019

Keywords

  • Air transportation
  • multi-objective optimization problem
  • Pareto solutions
  • Vehicle Routing Problem with Time Windows

Cite this

@article{612dda423a7d4982828b3621774e7ff6,
title = "An improved method for scheduling aircraft ground handling operations from a global perspective",
abstract = "The turnaround is a critical airport process where a set of interrelated operations need to be performed to get an aircraft ready for its next flight. These activities are carried out by different vehicles, which need to be coordinated to guarantee an efficient utilization of resources. Due to the relations between operations, the order in which these resources are scheduled has a critical influence on the planning and performance of the turnaround. In this work, we present a novel methodology for solving the proposed bi-objective ground handling scheduling problem from a global perspective. This means solving a set of interconnected routing problems with restrictive time windows for each operation. We first explore the solution space using a fast heuristic, focusing then on the most promising solutions to intensify the search in the vicinity of the Pareto frontier. This two-step schema permits significantly reducing the required computational time, which, in turn, allows a more thorough exploration of solutions. Different experiments over real data from two Spanish airports have been conducted to assess the proposed methodology. Our results show that the new method not only outperforms previous approaches in terms of computational requirements, but can also improve the quality of scheduling solutions.",
keywords = "Air transportation, multi-objective optimization problem, Pareto solutions, Vehicle Routing Problem with Time Windows",
author = "Silvia Padr{\'o}n and Daniel Guimarans",
year = "2019",
doi = "10.1142/S0217595919500209",
language = "English",
volume = "36",
journal = "Asia-Pacific Journal of Operational Research",
issn = "0217-5959",
publisher = "World Scientific Publishing",
number = "4",

}

An improved method for scheduling aircraft ground handling operations from a global perspective. / Padrón, Silvia; Guimarans, Daniel.

In: Asia-Pacific Journal of Operational Research, Vol. 36, No. 4, 1950020, 2019.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - An improved method for scheduling aircraft ground handling operations from a global perspective

AU - Padrón, Silvia

AU - Guimarans, Daniel

PY - 2019

Y1 - 2019

N2 - The turnaround is a critical airport process where a set of interrelated operations need to be performed to get an aircraft ready for its next flight. These activities are carried out by different vehicles, which need to be coordinated to guarantee an efficient utilization of resources. Due to the relations between operations, the order in which these resources are scheduled has a critical influence on the planning and performance of the turnaround. In this work, we present a novel methodology for solving the proposed bi-objective ground handling scheduling problem from a global perspective. This means solving a set of interconnected routing problems with restrictive time windows for each operation. We first explore the solution space using a fast heuristic, focusing then on the most promising solutions to intensify the search in the vicinity of the Pareto frontier. This two-step schema permits significantly reducing the required computational time, which, in turn, allows a more thorough exploration of solutions. Different experiments over real data from two Spanish airports have been conducted to assess the proposed methodology. Our results show that the new method not only outperforms previous approaches in terms of computational requirements, but can also improve the quality of scheduling solutions.

AB - The turnaround is a critical airport process where a set of interrelated operations need to be performed to get an aircraft ready for its next flight. These activities are carried out by different vehicles, which need to be coordinated to guarantee an efficient utilization of resources. Due to the relations between operations, the order in which these resources are scheduled has a critical influence on the planning and performance of the turnaround. In this work, we present a novel methodology for solving the proposed bi-objective ground handling scheduling problem from a global perspective. This means solving a set of interconnected routing problems with restrictive time windows for each operation. We first explore the solution space using a fast heuristic, focusing then on the most promising solutions to intensify the search in the vicinity of the Pareto frontier. This two-step schema permits significantly reducing the required computational time, which, in turn, allows a more thorough exploration of solutions. Different experiments over real data from two Spanish airports have been conducted to assess the proposed methodology. Our results show that the new method not only outperforms previous approaches in terms of computational requirements, but can also improve the quality of scheduling solutions.

KW - Air transportation

KW - multi-objective optimization problem

KW - Pareto solutions

KW - Vehicle Routing Problem with Time Windows

UR - http://www.scopus.com/inward/record.url?scp=85071510660&partnerID=8YFLogxK

U2 - 10.1142/S0217595919500209

DO - 10.1142/S0217595919500209

M3 - Article

VL - 36

JO - Asia-Pacific Journal of Operational Research

JF - Asia-Pacific Journal of Operational Research

SN - 0217-5959

IS - 4

M1 - 1950020

ER -