2008 · 25 citations · 8 references
Natural SciencesMarine EngineeringAlgorithmsOperations ResearchOptimizationAssignment ProblemsCombinatorial OptimizationEvolutionary ComputationEvolutionary OptimizationMulti-objective OptimizationMultiobjective OptimizationEvolutionary AlgorithmsInitializationLinear Assignment ProblemMulti-objective Evolutionary AlgorithmsMulti-objective Evolutionary ComputationMulti-objective Evolutionary OptimizationMultiobjective Evolutionary AlgorithmsSingle-objective Optimization
This paper examines the performance of two multiobjective evolutionary algorithms, NSGA-II and SPEA2, with informed initialization on large instances of United States Navy's Sailor Assignment Problem. The informed initialization includes in the initial population special solutions obtained by an extension of the Kuhn-Munkres algorithm. The Kuhn-Munkres algorithm, a classical algorithm that solves in $O(n^3)$ time instances of the single valued linear assignment problem, is extended here to render it applicable on single objective instances of the sailor assignment problem obtained using weight vectors to scalarize the natural multiobjective formulation. The Kuhn-Munkres extension is also used to provide a performance benchmark for comparison with the evolutionary algorithms.
8
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations