Skip to main content
Journal Article

Multicriteria evolutionary algorithm with tabu search for task assignment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 1993 373-384
DOI: 10.1007/3-540-44719-9_26
13Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, three evolutionary algorithms are discussed for solving three-criteria optimisation problem of finding a set of Pareto-optimal task assignments. Finally, the algorithm with a tabu mutation is recommended for solving an established multiobjective optimisation dilemma. Some numerical results are submitted. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Balicki, J., & Kitowski, Z. (2001). Multicriteria evolutionary algorithm with tabu search for task assignment. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1993, 373–384. https://doi.org/10.1007/3-540-44719-9_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free