Year: 2008
Type: article
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.
Source: Serdica Journal of Computing
Authors: Aleksandar Savić, Dušan Tošić, Miroslav Marić, Jozef Kratica
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2626319011
