Comparative analysis of the sailor assignment problem
Abstract
In this work the performance of several local search and metaheuristic methods is compared to previously reported work using evolutionary algorithms. The results show that while multiple algorithms are competitive on the Sailor Assignment Problem, the state-of-the-art evolutionary algorithm and a simulated annealing algorithm tend to provide the best performance. Additionally, some relevant features of the Sailor Assignment Problem are analyzed and used to explain the observed performance characteristics.
Publication Title
GECCO 2006 - Genetic and Evolutionary Computation Conference
Recommended Citation
Vannucci, J., Garrett, D., & Dasgupta, D. (2006). Comparative analysis of the sailor assignment problem. GECCO 2006 - Genetic and Evolutionary Computation Conference, 2, 1881-1882. https://doi.org/10.1145/1143997.1144310
