Understanding Team Dynamics with Agent-Based Simulation

Agent-based simulation is increasingly used in industry to model systems of interest allowing the evaluation of alternative scenarios. By this means, business managers can estimate the consequences of policy changes at low cost before implementing them in the business. However, in order to apply such models with confidence, it is necessary to validate them continuously against changing business patterns. Typically, models contain key parameters which significantly affect the overall behaviour of the system. The process of selecting such parameters is an inverse problem known as ‘tuning’ In this chapter, we describe the application of computational intelligence to tune the parameters of a workforce dynamics simulator. We show that the best algorithm achieves reduced tuning times as well as more accurate field workforce simulations. Since implementation, this algorithm has facilitated the use of simulation to assess the effect of changes in different business scenarios and transformation initiatives.

[1]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[2]  Siddhartha Shakya,et al.  DEUM : a framework for an estimation of distribution algorithm based on Markov random fields , 2006 .

[3]  Gilbert Owusu,et al.  Service Chain Management: Technology Innovation for the Service Business , 2010 .

[4]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[5]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[6]  J. Rodgers,et al.  Thirteen ways to look at the correlation coefficient , 1988 .

[7]  Anne Liret,et al.  Work Allocation and Scheduling , 2008 .

[8]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[9]  Pedro Larrañaga,et al.  Mathematical modelling of UMDAc algorithm with tournament selection. Behaviour on linear and quadratic functions , 2002, Int. J. Approx. Reason..

[10]  Siddhartha Shakya,et al.  Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms , 2006, GECCO '06.

[11]  Nazaraf Shah,et al.  Intelligent Agent Based Workforce Empowerment , 2009, KES-AMSTA.

[12]  Ying-ping Chen.  Exploitation of linkage learning in evolutionary algorithms , 2010 .

[13]  R. H. J. M. Otten,et al.  The Annealing Algorithm , 1989 .

[14]  Marcus Gallagher,et al.  Convergence analysis of UMDAC with finite populations: a case study on flat landscapes , 2009, GECCO '09.

[15]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[16]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[17]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[18]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[19]  François A. Fournier,et al.  DEUM – A Fully Multivariate EDA Based on Markov Networks , 2010 .

[20]  Siddhartha Shakya,et al.  Optimization by estimation of distribution with DEUM framework based on Markov random fields , 2007, Int. J. Autom. Comput..

[21]  S. Baluja.  An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics , 1995 .

[22]  Spyros Makridakis,et al.  The M3-Competition: results, conclusions and implications , 2000 .

[23]  Nazaraf Shah,et al.  On the partitioning of dynamic workforce scheduling problems , 2010, J. Sched..