论文信息 - Genetic Algorithm Approach for Solving the Task Assignment Problem

Genetic Algorithm Approach for Solving the Task Assignment Problem

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.

Jozef Kratica | Miroslav Marić | Aleksandar Savić | Dušan Tošić

[1] Stefka Fidanova,et al. Ant Algorithm for Grid Scheduling Problem , 2005, LSSC.

[2] Zorica Stanimirovic,et al. A Genetic Algorithm Approach for the Capacitated Single Allocation P-Hub Median Problem , 2012, Comput. Informatics.

[3] Melanie Mitchell,et al. An introduction to genetic algorithms , 1996 .

[4] M. Maric. An Efficient Genetic Algorithm for Solving the Multi-Level Uncapacitated Facility Location Problem , 2010, Comput. Informatics.

[5] Vladimir Filipovic,et al. Fine-grained Tournament Selection Operator in Genetic Algorithms , 2003, Comput. Artif. Intell..

[6] Hao Wang,et al. Introduction to Genetic Algorithms in Electromagnetics , 1995 .

[7] S. N. Sivanandam,et al. Introduction to genetic algorithms , 2007 .

[8] Jozef Kratica,et al. Improving Performances of the Genetic Algorithm by Caching , 1999, Comput. Artif. Intell..

[9] Jennifer M. Schopf,et al. A General Architecture for Scheduling on the Grid , 2003 .

[10] M. Cangalovic,et al. COMPUTING STRONG METRIC DIMENSION OF SOME SPECIAL CLASSES OF GRAPHS BY GENETIC ALGORITHMS , 2008 .

[11] Jozef Kratica,et al. Solving the Maximally Balanced Connected Partition Problem in Graphs by Using Genetic Algorithm , 2008, Comput. Informatics.