A multiobjective evolutionary algorithm for the task based sailor assignment problem
Abstract
This paper investigates a multiobjective formulation of the United States Navy's Task based Sailor Assignment Problem and examines the performance of a multiobjective evolutionary algorithm (MOEA), called NSGA-II, on large instances of this problem. Our previous work [3, 5, 4], consider the sailor assignment problem (SAP) as a static assignment, while the present work assumes it as a time dependent multitask SAP, making it a more complex problem, in fact, an NP-complete problem. Experimental results show that the presented genetic-based solution is appropriate for this problem. Copyright 2009 ACM.
Publication Title
Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
Recommended Citation
Dasgupta, D., Nino, F., Garrett, D., Chaudhuri, K., Medapati, S., & Kaushal, A. (2009). A multiobjective evolutionary algorithm for the task based sailor assignment problem. Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009, 1475-1482. https://doi.org/10.1145/1569901.1570099
