A Simple yet Effective Algorithm for the Asteroid Routing Problem

Valentino Santucci

2024

Abstract

In this paper we investigate the application of meta-heuristic algorithms in the context of expensive black-box permutation optimization. These problems are characterized by solution spaces composed of permutations of items, where the objective function is not explicitly defined in a closed mathematical form and is costly to evaluate. The benchmark problem under investigation is the Asteroid Routing Problem (ARP), which aims to determine the optimal order for a spacecraft to visit asteroids, starting from Earth’s orbit, while minimizing both energy consumption and visit time. In particular, we examine the effectiveness of a simple algorithm, namely FAT-RLS, which is mainly based on the randomized local search scheme, equipped with a tabu structure and a mechanism to regulate the perturbation strength. A series of experiments were performed on accepted instances of the ARP in order to compare the effectiveness of FAT-RLS with respect to two established meta-heuristics for the ARP. The results clearly show that FAT-RLS achieves more effective results both considering a black-box setting and an informed setting, where the meta-heuristics are seeded with a purposely designed constructive algorithm for the ARP.

Paper Citation

in Harvard Style

Santucci V. (2024). A Simple yet Effective Algorithm for the Asteroid Routing Problem. In Proceedings of the 16th International Joint Conference on Computational Intelligence - Volume 1: ECTA; ISBN 978-989-758-721-4, SciTePress, pages 50-59. DOI: 10.5220/0012908900003837

in Bibtex Style

@conference{ecta24,
author={Valentino Santucci},
title={A Simple yet Effective Algorithm for the Asteroid Routing Problem},
booktitle={Proceedings of the 16th International Joint Conference on Computational Intelligence - Volume 1: ECTA},
year={2024},
pages={50-59},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012908900003837},
isbn={978-989-758-721-4},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 16th International Joint Conference on Computational Intelligence - Volume 1: ECTA
TI - A Simple yet Effective Algorithm for the Asteroid Routing Problem
SN - 978-989-758-721-4
AU - Santucci V.
PY - 2024
SP - 50
EP - 59
DO - 10.5220/0012908900003837
PB - SciTePress