Genetic algorithms for the sailor assignment problem
Abstract
This paper examines a real-world application of genetic algorithms - solving the United States Navy's Sailor Assignment Problem (SAP). The SAP is a complex assignment problem in which each of n sailors must be assigned one job drawn from a set of m jobs. The goal is to find a set of these assignments such that the overall desirability of the match is maximized while the cost of the match is minimized. We compare genetic algorithms to an existing algorithm, the Gale-Shapley algorithm, for generating these assignments and present empirical results showing that the GA is able to produce good solutions with significant savings in cost. Finally, we examine the possibility of using the GA to generate multiple different solutions for presentation to a human decision maker called a detailer, and we show that the GA can be used to provide a sample of good solutions. Copyright 2005 ACM.
Publication Title
GECCO 2005 - Genetic and Evolutionary Computation Conference
Recommended Citation
Garrett, D., Vannucci, J., Silva, R., Dasgupta, D., & Simien, J. (2005). Genetic algorithms for the sailor assignment problem. GECCO 2005 - Genetic and Evolutionary Computation Conference, 1921-1928. https://doi.org/10.1145/1068009.1068333
