A comparison of multiobjective evolutionary algorithms with informed initialization and kuhn-munkres algorithm for the sailor assignment problem

Authors:
Dipankar Dasgupta;German Hernandez;Deon Garrett;Pavan Kalyan Vejandla;Aishwarya Kaushal;Ramjee Yerneni;James Simien
Affiliations:
University of Memphis, Memphis, TN, USA;University of Memphis, Memphis, TN, USA;University of Memphis, Memphis, TN, USA;University of Memphis, Memphis, TN, USA;University of Memphis, Memphis, TN, USA;University of Memphis, Memphis, TN, USA;Navy Personnel Research, Studies, and Technology, Millington, TN, USA
Venue:
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Year:
2008

Citing 4
Cited 4

An extension of the Munkres algorithm for the assignment problem to rectangular matrices

Communications of the ACM
Navy Personnel Planning and the Optimal Partition

Operations Research
Genetic algorithms for the sailor assignment problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

Why an AI research team adopted XP practices

Proceedings of the 47th Annual Southeast Regional Conference
A multiobjective evolutionary algorithm for the task based sailor assignment problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A weighted bipartite graph based network selection scheme for multi-flows in heterogeneous wireless network

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On heuristics for two-sided matching: revisiting the stable marriage problem as a multiobjective problem

Proceedings of the 12th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.