×

The multiple team formation problem using sociometry. (English) Zbl 1349.90548

Summary: The Team Formation problem (TFP) has become a well-known problem in the OR literature over the last few years. In this problem, the allocation of multiple individuals that match a required set of skills as a group must be chosen to maximise one or several social positive attributes. Specifically, the aim of the current research is two-fold. First, two new dimensions of the TFP are added by considering multiple projects and fractions of people’s dedication. This new problem is named the Multiple Team Formation Problem (MTFP). Second, an optimisation model consisting in a quadratic objective function, linear constraints and integer variables is proposed for the problem. The optimisation model is solved by three algorithms: a Constraint Programming approach provided by a commercial solver, a Local Search heuristic and a Variable Neighbourhood Search metaheuristic. These three algorithms constitute the first attempt to solve the MTFP, being a variable neighbourhood local search metaheuristic the most efficient in almost all cases. Applications of this problem commonly appear in real-life situations, particularly with the current and ongoing development of social network analysis. Therefore, this work opens multiple paths for future research.

MSC:

90B70 Theory of organizations, manpower planning in operations research
91D30 Social networks; opinion dynamics
91D35 Manpower systems in sociology

References:

[2] Agustín-Blas, L. E.; Salcedo-Sanz, S.; Ortiz-García, E. G.; Portilla-Figueras, A.; Pérez-Bellido, A. M.; Jiménez-Fernández, S., Team formation based on group technology: a hybrid grouping genetic algorithm approach, Comput Oper Res, 38, 2, 484-495 (2011) · Zbl 1232.68099
[3] Aringhieri, R., Composing medical crews with equity and efficiency, Cent Eur J Oper Res, 17, 3, 343-357 (2009) · Zbl 1204.90056
[4] Aringhieri, R.; Landa, P.; Soriano, P.; Tànfani, E.; Testi, A., A two level metaheuristic for the operating room scheduling and assignment problem, Comput Oper Res, 54, 21-34 (2015) · Zbl 1348.90240
[5] Awal, G. K.; Bharadwaj, K. K., Team formation in social networks based on collective intelligence - an evolutionary approach, Appl Intell, 41, 2, 627-648 (2014)
[6] Babad, E., On the conception and measurement of popularity: more facts and some straight conclusions, Soc Psychol Educ, 5, 1, 3-29 (2001)
[7] Bailey, D. E., Manufacturing improvement team programs in the semiconductor industry, Semicond Manuf, IEEE Trans Semicond Manuf Addresses Chall Probl Manuf Complex Microelectron Components, 10, 1, 1-10 (1997)
[8] Ballesteros-Pérez, P.; González-Cruz, M. C.; Fernández-Diego, M., Human resource allocation management in multiple projects using sociometric techniques, Int J Proj Manag, 30, 8, 901-913 (2012)
[9] Ballesteros-Pérez, P.; González-Cruz, M. C.; Pastor-Ferrando, J., Analysis of construction projects by means of value curves, Int J Proj Manag, 28, 7, 719-731 (2010)
[11] Ballesteros-Pérez, P.; González-Cruz, M.; Fernández-Diego, M.; Pellicer, E., Estimating future bidding performance of competitor bidders in capped tenders, J Civil Eng Manag, 20, 5, 702-713 (2014)
[12] Baykasoglu, A.; Dereli, T.; Das, S., Project team selection using fuzzy optimization approach, Cybern Syst, 38, 2, 155-185 (2007) · Zbl 1156.90465
[13] Blum, C.; Puchinger, J.; Raidl, G. R.; Roli, A., Hybrid metaheuristics in combinatorial optimizationa survey, Appl Soft Comput, 11, 6, 4135-4151 (2011)
[14] Campion, M. A.; Medsker, G. J.; Higgs, A. C., Relations between work group characteristics and effectiveness: implications for designing effective work groups, Pers Psychol, 46, 4, 823-847 (1993)
[15] Caprara, A.; Fischetti, M.; Toth, P.; Vigo, D.; Guida, P. L., Algorithms for railway crew management, Math Program, 79, 1-3, 125-141 (1997) · Zbl 0887.90056
[17] Chen, R.-C., Grouping optimization based on social relationships, Math Probl Eng 2012 (2012) · Zbl 1264.91101
[18] Chen, R. C.; Li, J. Y.; Ma, N. J.; Chang, Y. T., Application of sociometry and genetic algorithm to selection of class officers, Inf (Jpn), 16, 2 A, 1233-1241 (2013)
[19] Croes, G. A., A method for solving traveling-salesman problems, Oper Res, 6, 6, 791-812 (1958) · Zbl 1414.90303
[20] De Backer, B.; Furnon, V.; Shaw, P.; Kilby, P.; Prosser, P., Solving vehicle routing problems using constraint programming and metaheuristics, J Heuristics, 6, 4, 501-523 (2000) · Zbl 0972.68631
[21] Delgado-Osuna, J.; Lozano, M.; García-Martínez, C., An alternative artificial bee colony algorithm with destructive-constructive neighbourhood operator for the problem of composing medical crews, Inf Sci, 326, 215-226 (2016)
[23] Falkenauer, E., Genetic algorithms and grouping problems (1998), John Wiley & Sons, Inc. · Zbl 0803.68037
[25] Farhadi, F.; Sorkhi, M.; Hashemi, S.; Hamzeh, A., An effective framework for fast expert mining in collaboration networks: a group-oriented and cost-based method, J Comput Sci Technol, 27, 3, 577-590 (2012)
[26] Fitzpatrick, E. L.; Askin, R. G., Forming effective worker teams with multi-functional skill requirements, Comput Ind Eng, 48, 3, 593-608 (2005)
[30] Hansen, P.; Mladenović, N.; Pérez, J. A.M., Variable neighbourhood search: methods and applications, Ann Oper Res, 175, 1, 367-407 (2010) · Zbl 1185.90211
[31] Hendriks, M.; Voeten, B.; Kroep, L., Human resource allocation in a multi-project R&D environment, Int J Proj Manag, 17, 3, 181-188 (1999)
[32] Hollenbeck, J. R.; DeRue, D. S.; Guzzo, R., Bridging the gap between I/O research and HR practice: improving team composition, team training, and team task design, Hum Resour Manag, 43, 4, 353-366 (2004)
[34] Jacob, L. M.; Helen, H. J., The sociometry reader, 35 (1960), The Free Press: The Free Press Glencoe (Illinois)
[35] Johnson, D. S.; Aragon, C. R.; McGeoch, L. A.; Schevon, C., Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning, Oper Res, 39, 3, 378-406 (1991) · Zbl 0739.90055
[36] Kirkpatrick, S., Optimization by simulated annealing: quantitative studies, J Stat Phys, 34, 5-6, 975-986 (1984)
[39] Li, C.-T.; Shan, M.-K.; Lin, S.-D., On team formation with expertise query in collaborative social networks, Knowl Inf Syst, 42, 2, 441-463 (2013)
[40] Lin, C.; Gen, M., Multi-criteria human resource allocation for solving multistage combinatorial optimization problems using multiobjective hybrid genetic algorithm, Expert Syst Appl, 34, 4, 2480-2490 (2008)
[41] Liu, C.; Yang, S., A hybrid genetic algorithm for integrated project task and multi-skilled workforce scheduling, J Comput Inf Syst, 7, 6, 2187-2194 (2011)
[42] Maurer, I., How to build trust in inter-organizational projects: the impact of project staffing and project rewards on the formation of trust, knowledge acquisition and product innovation, Int J Proj Manag, 28, 7, 629-637 (2010)
[43] Mladenović, N.; Hansen, P., Variable neighborhood search, Comput Oper Res, 24, 11, 1097-1100 (1997) · Zbl 0889.90119
[44] Mora-Melia, D.; Iglesias-Rey, P.; Martinez-Solano, F.; Ballesteros-Pérez, P., Efficiency of evolutionary algorithms in water network pipe sizing, Water Resour Manag, 29, 13, 4817-4831 (2015)
[45] Moreno, J. L., Foundations of sociometry: an introduction, Sociometry, 4, 1, 15-35 (1941)
[47] Russell, S. J.; Norvig, P., Artificial Intelligence: a modern approach (2009), Pearson Education
[48] Shi, Z.; Hao, F., A strategy of multi-criteria decision-making task ranking in social-networks, J Supercomput, 66, 1, 556-571 (2013)
[51] Van Laarhoven, P. J.; Aarts, E. H.; Lenstra, J. K., Job shop scheduling by simulated annealing, Oper Res, 40, 1, 113-125 (1992) · Zbl 0751.90039
[52] Wi, H.; Oh, S.; Mun, J.; Jung, M., A team formation model based on knowledge and collaboration, Expert Syst Appl, 36, 5, 9121-9134 (2009)
[53] Xing, B.; Gao, W.-J., Innovative computational intelligence: a rough guide to 134 clever algorithms (2014), Springer Publishing Company · Zbl 1330.68004
[55] Zzkarian, A.; Kusiak, A., Forming teams: an analytical approach, IIE Trans, 31, 1, 85-97 (1999)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.