Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/39570
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lugo, L | - |
dc.contributor.author | BELLO GARCIA, Marilyn | - |
dc.contributor.author | Nowe, A | - |
dc.contributor.author | Bello, R | - |
dc.date.accessioned | 2023-02-21T14:48:12Z | - |
dc.date.available | 2023-02-21T14:48:12Z | - |
dc.date.issued | 2018 | - |
dc.date.submitted | 2023-02-21T08:06:49Z | - |
dc.identifier.citation | Lecture Notes in Computer Science, SPRINGER INTERNATIONAL PUBLISHING AG, p. 325 -332 | - |
dc.identifier.isbn | 978-3-030-00532-0 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/1942/39570 | - |
dc.description.abstract | The team selection problem is usually solved by ranking candidates based on the preferences of decision-makers and allowing the decision-makers to take turns selecting candidates. While this solution method is simple and might seem fair it usually results in an unfair allocation of candidates to the different teams, i.e. the quality of the teams might be quite different according to the rankings articulated by the decision-makers. In this paper, we propose a new method based on Ant Colony Optimization (ACO), where the selection process is performed in a new context, with more than two decision-makers selecting from a common set of candidates. Furthermore, a plugin implementing this method for the KNIME platform was developed. | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER INTERNATIONAL PUBLISHING AG | - |
dc.title | A Solution for the Team Selection Problem Using ACO | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.conferencedate | OCT 29-31, 2018 | - |
local.bibliographicCitation.conferencename | 11th International Conference on Swarm Intelligence (ANTS) | - |
local.bibliographicCitation.conferenceplace | Rome, ITALY | - |
dc.identifier.epage | 332 | - |
dc.identifier.spage | 325 | - |
dc.identifier.volume | 11172 | - |
local.bibliographicCitation.jcat | C1 | - |
local.publisher.place | GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
dc.identifier.doi | 10.1007/978-3-030-00533-7_26 | - |
dc.identifier.isi | 000672741400026 | - |
dc.identifier.eissn | 1611-3349 | - |
local.provider.type | Web of Science | - |
local.bibliographicCitation.btitle | Lecture Notes in Computer Science | - |
local.uhasselt.international | yes | - |
item.fullcitation | Lugo, L; BELLO GARCIA, Marilyn; Nowe, A & Bello, R (2018) A Solution for the Team Selection Problem Using ACO. In: Lecture Notes in Computer Science, SPRINGER INTERNATIONAL PUBLISHING AG, p. 325 -332. | - |
item.validation | ecoom 2022 | - |
item.fulltext | With Fulltext | - |
item.accessRights | Restricted Access | - |
item.contributor | Lugo, L | - |
item.contributor | BELLO GARCIA, Marilyn | - |
item.contributor | Nowe, A | - |
item.contributor | Bello, R | - |
crisitem.journal.issn | 1935-3812 | - |
crisitem.journal.eissn | 1935-3820 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
978-3-030-00533-7_26.pdf Restricted Access | Published version | 217.19 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.