In this paper, an improved negative selection procedure to handle constraints in a multi-criterion evolutionary algorithm has been proposed. The problem that is of interest to us is the complex task assignment for a distributed computer system. Both a workload of a bottleneck computer and the cost of system are minimized; in contrast, a reliability of the system is maximized. Moreover, constraints related to memory limits and computer locations are imposed. Finally, an evolutionary algorithm with tabu search procedure and the improved negative selection is proposed to provide effective solutions. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Balicki, J. (2006). Negative selection with ranking procedure in Tabu-based multi-criterion evolutionary algorithm for task assignment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3993 LNCS-III, pp. 863–870). Springer Verlag. https://doi.org/10.1007/11758532_112
Mendeley helps you to discover research relevant for your work.