Optimizing Dynamic Airlift Operations: Winning Strategies in the AFRL Airlift Challenge

Autores/as

  • John Kolen None

DOI:

https://doi.org/10.32473/flairs.37.1.135825

Palabras clave:

Optimization, Dynamic Airlift Problem, Iterated Optimization, Competitions

Resumen

The Air Force Research Laboratory (AFRL) has sponsored the Airlift Challenge
over the past two years, aimed at addressing the dynamic airlift problem. The
dynamic nature of the challenge included the random disappearance of graph
edges to simulate adverse weather conditions and the spontaneous appearance of
cargo requiring delivery. This poster presents the systems that won both the 2023
and 2024 challenges. The initial approach focused
on intelligent solutions for subtasks, or 'build-smart'. It soon became clear
that the optimization of the scoring rate, points per second, was more
important than single instance metric performance. In the subsequent
competition, a 'build-fast' strategy was adopted due to this observation. This
paper discusses the impact of iteration on algorithm selection for optimization
problems and suggests considerations for structuring scoring processes in
future competitions.

Descargas

Publicado

2024-05-12

Cómo citar

Kolen, J. (2024). Optimizing Dynamic Airlift Operations: Winning Strategies in the AFRL Airlift Challenge. The International FLAIRS Conference Proceedings, 37(1). https://doi.org/10.32473/flairs.37.1.135825