Optimization of assignment of tasks to teams using multi-objective metaheuristics
2013 (English)In: GECCO 2013 - Proceedings of the 2013 Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery (ACM), 2013, 103-104 p.Conference paper (Refereed)
A highly interesting but not thoroughly addressed optimization problem is a variation of the Assignment Problem (AP) where tasks are assigned to groups of collaborating agents (teams). In this paper, we address this class of AP as a bi-objective optimization problem, in which the cost is minimized and the quality is maximized. To solve the model, we adopt Non-dominated Sorting Genetic Algorithm-II (NSGAII) and Strength Pareto Evolutionary Algorithm 2 (SPEA2). We conduct several experiments on problems with varying sizes to compare the NSGA-II and SPEA2 algorithms.
Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2013. 103-104 p.
Multi-objective optimization, combinatorial optimization, metaheuristics, assignment problem
IdentifiersURN: urn:nbn:se:kth:diva-125914DOI: 10.1145/2464576.2464624ScopusID: 2-s2.0-84882367332ISBN: 978-1-4503-1964-5OAI: oai:DiVA.org:kth-125914DiVA: diva2:641395
15th Annual Conference on Genetic and Evolutionary Computation, GECCO 2013; Amsterdam; Netherlands; 6 July 2013 through 10 July 2013
QC 201401282013-08-162013-08-162014-03-28Bibliographically approved