Translator Disclaimer
2 May 2007 The multi-objective constrained assignment problem
Author Affiliations +
Abstract
Assignment problems are a common area of research in operational research and computer science. Military applications include military personnel assignment, combat radio frequency assignment, and weapon target assignment. In general, assignment problems can be found in a wide array of areas, from modular placement to resource scheduling. Many of these problems are very similar to one another. This paper models and compares some of the assignment problems in literature. These similar problems are then generalized into a generalized multi-objective problem, the constrained assignment problem. Using a multi-objective genetic algorithm, we solve an example of a constrained assignment problem called the airman assignment problem. Results show that good solutions along the interior portion of the Pareto front are found in earlier generations and later generations produce more exterior points.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mark P. Kleeman and Gary B. Lamont "The multi-objective constrained assignment problem", Proc. SPIE 6563, Evolutionary and Bio-inspired Computation: Theory and Applications, 656307 (2 May 2007); https://doi.org/10.1117/12.720964
PROCEEDINGS
13 PAGES


SHARE
Advertisement
Advertisement
Back to Top