The socio-technical teams formation problem: Complexity, Mathematical Formulations and Computational Results
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Tipo de documento: | Dissertação |
Idioma: | por |
Título da fonte: | Biblioteca Digital de Teses e Dissertações da UFC |
Texto Completo: | http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15392 |
Resumo: | Using concepts of the socio-technical systems theory, this dissertation defines mathematically the problems of cooperative teams formation considering social and technical constraints separately, and then presents their computational complexity. Mainly, it is defined and studied the central problem in this work, which jointly considers social and technical requirements for creating teams of cooperative work, to be called FEST (Socio-Technical Teams Formation Problem). Two mathematical formulations and a meta-heuristic are proposed for FEST. One formulation uses a cubic number of variables and constraints, whereas the second one has a quadratic number of variables but an exponential number of constraints. The proposed heuristic is based on the Non-monotonic Simulated Annealing meta-heuristic with local search using swap-like operators. The correctness of both formulations is proved. A polynomial algorithm to separate the constraints of the second formulation is presented. It is proved that the two formulations provide the same linear programming bound, and valid inequalities to strengthen it are proposed. For the compact formulation, some classes of valid inequalities are shown to be facet-inducing under suitable hypotheses. Finally, it is statistically analyzed the performance of the presented formulations and meta-heuristic. Real and random generated instances are used in the computational experiments. |
id |
UFC_04d6b9830b690b2fd97ca8a39a7a9a03 |
---|---|
oai_identifier_str |
oai:www.teses.ufc.br:10009 |
network_acronym_str |
UFC |
network_name_str |
Biblioteca Digital de Teses e Dissertações da UFC |
spelling |
info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisThe socio-technical teams formation problem: Complexity, Mathematical Formulations and Computational ResultsProblema de FormaÃÃo de Equipes SociotÃcnicas: Complexidade, FormulaÃÃes MatemÃticas e Resultados Computacionais2014-08-14Manoel Bezerra Campelo Neto32171684372http://lattes.cnpq.br/7207626266770213Carlos Diego Rodrigues85130885368http://lattes.cnpq.br/4351787196667659Ana Shirley Ferreira da Silva62219340368http://lattes.cnpq.br/2132614695901416Victor Almeida Campos86698974315http://lattes.cnpq.br/0802023762311924Humberto CÃsar BrandÃo de Oliveira05882159610http://lattes.cnpq.br/383204563236963909161281646http://lattes.cnpq.br/4390042021035867Tatiane Fernandes FigueiredoUniversidade Federal do CearÃPrograma de PÃs-GraduaÃÃo em CiÃncia da ComputaÃÃoUFCBRTrabalho cooperativoGerÃncia de pessoasComplexidade computacionalProgramaÃÃo inteiraCombinatÃria poliÃdricaHeurÃsticaProgramaÃÃo heuristicaAdministraÃÃo de pessoalCooperative workPeople manegementComputational complexityInteger programmingPolyhedral combinatoricsHeuristic CIENCIA DA COMPUTACAOUsing concepts of the socio-technical systems theory, this dissertation defines mathematically the problems of cooperative teams formation considering social and technical constraints separately, and then presents their computational complexity. Mainly, it is defined and studied the central problem in this work, which jointly considers social and technical requirements for creating teams of cooperative work, to be called FEST (Socio-Technical Teams Formation Problem). Two mathematical formulations and a meta-heuristic are proposed for FEST. One formulation uses a cubic number of variables and constraints, whereas the second one has a quadratic number of variables but an exponential number of constraints. The proposed heuristic is based on the Non-monotonic Simulated Annealing meta-heuristic with local search using swap-like operators. The correctness of both formulations is proved. A polynomial algorithm to separate the constraints of the second formulation is presented. It is proved that the two formulations provide the same linear programming bound, and valid inequalities to strengthen it are proposed. For the compact formulation, some classes of valid inequalities are shown to be facet-inducing under suitable hypotheses. Finally, it is statistically analyzed the performance of the presented formulations and meta-heuristic. Real and random generated instances are used in the computational experiments. Utilizando conceitos da Teoria dos Sistemas SociotÃcnicos, este trabalho define matematicamente os problemas de formaÃÃo de equipes cooperativas considerando separadamente restriÃÃes sociais e tÃcnicas e apresenta a complexidade computacional dos mesmos. Sobretudo, à definido e estudado o problema central deste trabalho, que considera conjuntamente requisitos sociais e tÃcnicos para criaÃÃo de equipes de trabalho cooperativo, denominado FEST (Problema de FormaÃÃo de Equipes SociotÃcnicas). Duas formulaÃÃes matemÃticas e uma meta-heurÃstica para o FEST sÃo propostas. Uma formulaÃÃo utiliza um nÃmero cÃbico de variÃveis e restriÃÃes, enquanto a segunda formulaÃÃo possui um nÃmero quadrÃtico de variÃveis, mas um nÃmero exponencial de restriÃÃes. A meta-heurÃstica proposta à baseada no Simulated Annealing NÃo-MonotÃnico com busca local que usa operadores tipo swap. A corretude de ambas as formulaÃÃes à provada. Um algoritmo polinomial para separar as restriÃÃes da segunda formulaÃÃo à apresentado. Mostra-se que as duas formulaÃÃes fornecem o mesmo limite de programaÃÃo linear, e desigualdades vÃlidas para fortalecÃ-lo sÃo propostas. Para a formulaÃÃo compacta, algumas classes de desigualdades vÃlidas sÃo demonstradas indutoras de facetas sob hipÃteses apropriadas. Por fim, foi analisado estatisticamente o desempenho das formulaÃÃes e da meta-heurÃstica apresentadas. InstÃncias reais e geradas aleatoriamente sÃo usadas nos experimentos computacionais. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15392application/pdfinfo:eu-repo/semantics/openAccessporreponame:Biblioteca Digital de Teses e Dissertações da UFCinstname:Universidade Federal do Cearáinstacron:UFC2019-01-21T11:29:05Zmail@mail.com - |
dc.title.en.fl_str_mv |
The socio-technical teams formation problem: Complexity, Mathematical Formulations and Computational Results |
dc.title.alternative.pt.fl_str_mv |
Problema de FormaÃÃo de Equipes SociotÃcnicas: Complexidade, FormulaÃÃes MatemÃticas e Resultados Computacionais |
title |
The socio-technical teams formation problem: Complexity, Mathematical Formulations and Computational Results |
spellingShingle |
The socio-technical teams formation problem: Complexity, Mathematical Formulations and Computational Results Tatiane Fernandes Figueiredo Trabalho cooperativo GerÃncia de pessoas Complexidade computacional ProgramaÃÃo inteira CombinatÃria poliÃdrica HeurÃstica ProgramaÃÃo heuristica AdministraÃÃo de pessoal Cooperative work People manegement Computational complexity Integer programming Polyhedral combinatorics Heuristic CIENCIA DA COMPUTACAO |
title_short |
The socio-technical teams formation problem: Complexity, Mathematical Formulations and Computational Results |
title_full |
The socio-technical teams formation problem: Complexity, Mathematical Formulations and Computational Results |
title_fullStr |
The socio-technical teams formation problem: Complexity, Mathematical Formulations and Computational Results |
title_full_unstemmed |
The socio-technical teams formation problem: Complexity, Mathematical Formulations and Computational Results |
title_sort |
The socio-technical teams formation problem: Complexity, Mathematical Formulations and Computational Results |
author |
Tatiane Fernandes Figueiredo |
author_facet |
Tatiane Fernandes Figueiredo |
author_role |
author |
dc.contributor.advisor1.fl_str_mv |
Manoel Bezerra Campelo Neto |
dc.contributor.advisor1ID.fl_str_mv |
32171684372 |
dc.contributor.advisor1Lattes.fl_str_mv |
http://lattes.cnpq.br/7207626266770213 |
dc.contributor.referee1.fl_str_mv |
Carlos Diego Rodrigues |
dc.contributor.referee1ID.fl_str_mv |
85130885368 |
dc.contributor.referee1Lattes.fl_str_mv |
http://lattes.cnpq.br/4351787196667659 |
dc.contributor.referee2.fl_str_mv |
Ana Shirley Ferreira da Silva |
dc.contributor.referee2ID.fl_str_mv |
62219340368 |
dc.contributor.referee2Lattes.fl_str_mv |
http://lattes.cnpq.br/2132614695901416 |
dc.contributor.referee3.fl_str_mv |
Victor Almeida Campos |
dc.contributor.referee3ID.fl_str_mv |
86698974315 |
dc.contributor.referee3Lattes.fl_str_mv |
http://lattes.cnpq.br/0802023762311924 |
dc.contributor.referee4.fl_str_mv |
Humberto CÃsar BrandÃo de Oliveira |
dc.contributor.referee4ID.fl_str_mv |
05882159610 |
dc.contributor.referee4Lattes.fl_str_mv |
http://lattes.cnpq.br/3832045632369639 |
dc.contributor.authorID.fl_str_mv |
09161281646 |
dc.contributor.authorLattes.fl_str_mv |
http://lattes.cnpq.br/4390042021035867 |
dc.contributor.author.fl_str_mv |
Tatiane Fernandes Figueiredo |
contributor_str_mv |
Manoel Bezerra Campelo Neto Carlos Diego Rodrigues Ana Shirley Ferreira da Silva Victor Almeida Campos Humberto CÃsar BrandÃo de Oliveira |
dc.subject.por.fl_str_mv |
Trabalho cooperativo GerÃncia de pessoas Complexidade computacional ProgramaÃÃo inteira CombinatÃria poliÃdrica HeurÃstica ProgramaÃÃo heuristica AdministraÃÃo de pessoal |
topic |
Trabalho cooperativo GerÃncia de pessoas Complexidade computacional ProgramaÃÃo inteira CombinatÃria poliÃdrica HeurÃstica ProgramaÃÃo heuristica AdministraÃÃo de pessoal Cooperative work People manegement Computational complexity Integer programming Polyhedral combinatorics Heuristic CIENCIA DA COMPUTACAO |
dc.subject.eng.fl_str_mv |
Cooperative work People manegement Computational complexity Integer programming Polyhedral combinatorics Heuristic |
dc.subject.cnpq.fl_str_mv |
CIENCIA DA COMPUTACAO |
dc.description.abstract.por.fl_txt_mv |
Using concepts of the socio-technical systems theory, this dissertation defines mathematically the problems of cooperative teams formation considering social and technical constraints separately, and then presents their computational complexity. Mainly, it is defined and studied the central problem in this work, which jointly considers social and technical requirements for creating teams of cooperative work, to be called FEST (Socio-Technical Teams Formation Problem). Two mathematical formulations and a meta-heuristic are proposed for FEST. One formulation uses a cubic number of variables and constraints, whereas the second one has a quadratic number of variables but an exponential number of constraints. The proposed heuristic is based on the Non-monotonic Simulated Annealing meta-heuristic with local search using swap-like operators. The correctness of both formulations is proved. A polynomial algorithm to separate the constraints of the second formulation is presented. It is proved that the two formulations provide the same linear programming bound, and valid inequalities to strengthen it are proposed. For the compact formulation, some classes of valid inequalities are shown to be facet-inducing under suitable hypotheses. Finally, it is statistically analyzed the performance of the presented formulations and meta-heuristic. Real and random generated instances are used in the computational experiments. Utilizando conceitos da Teoria dos Sistemas SociotÃcnicos, este trabalho define matematicamente os problemas de formaÃÃo de equipes cooperativas considerando separadamente restriÃÃes sociais e tÃcnicas e apresenta a complexidade computacional dos mesmos. Sobretudo, à definido e estudado o problema central deste trabalho, que considera conjuntamente requisitos sociais e tÃcnicos para criaÃÃo de equipes de trabalho cooperativo, denominado FEST (Problema de FormaÃÃo de Equipes SociotÃcnicas). Duas formulaÃÃes matemÃticas e uma meta-heurÃstica para o FEST sÃo propostas. Uma formulaÃÃo utiliza um nÃmero cÃbico de variÃveis e restriÃÃes, enquanto a segunda formulaÃÃo possui um nÃmero quadrÃtico de variÃveis, mas um nÃmero exponencial de restriÃÃes. A meta-heurÃstica proposta à baseada no Simulated Annealing NÃo-MonotÃnico com busca local que usa operadores tipo swap. A corretude de ambas as formulaÃÃes à provada. Um algoritmo polinomial para separar as restriÃÃes da segunda formulaÃÃo à apresentado. Mostra-se que as duas formulaÃÃes fornecem o mesmo limite de programaÃÃo linear, e desigualdades vÃlidas para fortalecÃ-lo sÃo propostas. Para a formulaÃÃo compacta, algumas classes de desigualdades vÃlidas sÃo demonstradas indutoras de facetas sob hipÃteses apropriadas. Por fim, foi analisado estatisticamente o desempenho das formulaÃÃes e da meta-heurÃstica apresentadas. InstÃncias reais e geradas aleatoriamente sÃo usadas nos experimentos computacionais. |
description |
Using concepts of the socio-technical systems theory, this dissertation defines mathematically the problems of cooperative teams formation considering social and technical constraints separately, and then presents their computational complexity. Mainly, it is defined and studied the central problem in this work, which jointly considers social and technical requirements for creating teams of cooperative work, to be called FEST (Socio-Technical Teams Formation Problem). Two mathematical formulations and a meta-heuristic are proposed for FEST. One formulation uses a cubic number of variables and constraints, whereas the second one has a quadratic number of variables but an exponential number of constraints. The proposed heuristic is based on the Non-monotonic Simulated Annealing meta-heuristic with local search using swap-like operators. The correctness of both formulations is proved. A polynomial algorithm to separate the constraints of the second formulation is presented. It is proved that the two formulations provide the same linear programming bound, and valid inequalities to strengthen it are proposed. For the compact formulation, some classes of valid inequalities are shown to be facet-inducing under suitable hypotheses. Finally, it is statistically analyzed the performance of the presented formulations and meta-heuristic. Real and random generated instances are used in the computational experiments. |
publishDate |
2014 |
dc.date.issued.fl_str_mv |
2014-08-14 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/masterThesis |
status_str |
publishedVersion |
format |
masterThesis |
dc.identifier.uri.fl_str_mv |
http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15392 |
url |
http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15392 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Universidade Federal do Cearà |
dc.publisher.program.fl_str_mv |
Programa de PÃs-GraduaÃÃo em CiÃncia da ComputaÃÃo |
dc.publisher.initials.fl_str_mv |
UFC |
dc.publisher.country.fl_str_mv |
BR |
publisher.none.fl_str_mv |
Universidade Federal do Cearà |
dc.source.none.fl_str_mv |
reponame:Biblioteca Digital de Teses e Dissertações da UFC instname:Universidade Federal do Ceará instacron:UFC |
reponame_str |
Biblioteca Digital de Teses e Dissertações da UFC |
collection |
Biblioteca Digital de Teses e Dissertações da UFC |
instname_str |
Universidade Federal do Ceará |
instacron_str |
UFC |
institution |
UFC |
repository.name.fl_str_mv |
-
|
repository.mail.fl_str_mv |
mail@mail.com |
_version_ |
1643295214185480192 |