GenoSAP-II is a Navy-funded project to apply genetic algorithms for solving the 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. Our studies show that the GA is able to produce good solutions with significant savings in cost comared to the Gale-Shapley algorithm.
GenoSAP has been an ongoing project (since October 2004), for information regarding GenoSAP contact Prof. Dipankar Dasgupta at dasgupta@memphis.edu.Dipankar Dasgupta, German Hernandez, Deon Garrett, Pavan Kalyan Vejandla, Aishwarya Kaushal, Ramjee Yerneni, James Simien. A Comparison Of Multiobjective Evolutionary Algorithms with Informed Initialization and Kuhn-Munkres Algorithm for the Sailor Assignment Problem. In the proceedings of The Genetic and Evolutionary Computation Conference (Late Breaking Paper). Atlanta, Georgia: July, 12-16 2008.
J. Vannucci, D. Garrett, D. Dasgupta. Comparative Analysis of the Sailor Assignment Problem. Genetic and Evolutionary Computation Conference (GECCO). Seattle, Washington: July, 8-12 2006.
D. Garrett, J. Vannucci, R. Silva, D. Dasgupta, J. Simien. Genetic Algorithms for the Sailor Assignment Problem, In the Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) (was nominated for the Best paper award), pp 1921-1928, Washington DC, June 25-29, 2005.