A Meta-heuristically Approach of the Spatial Assignment Problem of Human Resources in Multi-sites Enterprise

The aim of this work is to present a meta-heuristically approach of the spatial assignment problem of human resources in multi-sites enterprise. Usually, this problem consists to move employees from one site to another based on one or more criteria. Our goal in this new approach is to improve the quality of service and performance of all sites with maximizing an objective function under some managers imposed constraints. The formulation presented here of this problem coincides perfectly with a Combinatorial Optimization Problem (COP) which is in the most cases NPhard to solve optimally. To avoid this difficulty, we have opted to use a meta-heuristic popular method, which is the genetic algorithm, to solve this problem in concrete cases. The results obtained have shown the effectiveness of our approach, which remains until now very costly in time. But the reduction of the time can be obtained by different ways that we plan to do in the next work.

[1]  P. Lopez,et al.  Planification multi-site : Modélisation sous forme d'un problème de satisfaction de contraintes dynamiques , 2012 .

[2]  Fred W. Glover,et al.  A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem , 2004, Discret. Optim..

[3]  Jin-Kao Hao,et al.  Tabu Search for Maximal Constraint Satisfaction Problems , 1997, CP.

[4]  R. Nagel,et al.  Agile Competitors and Virtual Organizations: Strategies for Enriching the Customer , 1994 .

[5]  Jaafar Abouchabaka,et al.  A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem , 2011, ArXiv.

[6]  Lawrence Davis,et al.  A Genetic Algorithm for Survivable Network Design , 1993, International Conference on Genetic Algorithms.

[7]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[8]  Lale Özbakir,et al.  Bees algorithm for generalized assignment problem , 2010, Appl. Math. Comput..

[9]  Nicolas Barnier,et al.  Optimisation par algorithme génétique sous contraintes , 1999 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Jaafar Abouchabaka,et al.  Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem , 2012, ArXiv.

[12]  Michel Gendreau,et al.  An efficient heuristic for reliability design optimization problems , 2010, Comput. Oper. Res..

[13]  Méziane Bennour,et al.  Une méthode d'affectation des ressources humaines aux processus industriels , 2008 .