Share Email Print

Proceedings Paper

The multi-objective constrained assignment problem
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 2 May 2007
PDF: 13 pages
Proc. SPIE 6563, Evolutionary and Bio-inspired Computation: Theory and Applications, 656307 (2 May 2007); doi: 10.1117/12.720964
Show Author Affiliations
Mark P. Kleeman, Air Force Institute of Technology (United States)
Gary B. Lamont, Air Force Institute of Technology (United States)

Published in SPIE Proceedings Vol. 6563:
Evolutionary and Bio-inspired Computation: Theory and Applications
Misty Blowers; Alex F. Sisti, Editor(s)

© SPIE. Terms of Use
Back to Top