Abstract
In this paper a genetic algorithm (GA) for the task assignment problem (TAP) is considered.An integer representation with standard genetic operators is used. Computational results are presented for instances from the literature, and compared to optimal solutions obtained by the CPLEX solver. It can be seen that the proposed GA approach reaches 17 of 20 optimal solutions. The GA solutions are obtained in a quite a short amount of computational time.
Cite
CITATION STYLE
APA
Savić, A., Tošić, D., Marić, M., & Kratica, J. (2008). Genetic Algorithm Approach for Solving the Task Assignment Problem. Serdica Journal of Computing, 2(3), 267–276. https://doi.org/10.55630/sjc.2008.2.267-276
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free