arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1310.8588cs.AI
收藏

多基地企业人力资源空间分配问题的元分析方法

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

Ibn Tofail University(伊本·托法尔大学);Abdelmalk Essaadi University(阿卜杜勒马利克·埃萨迪大学)

Tkatek Said, Abdoun Otman, Abouchabaka Jaafar, Rafalia Najat

摘要:

本文的目的是提出一种多站点企业人力资源空间分配问题的元分析方法。通常,这个问题包括根据一个或多个标准将员工从一个站点移动到另一个站点。我们的目标在这个新的方法是提高服务质量和性能的所有网站的最大化的目标函数下,一些管理人员施加的限制。这里提出的制定这个问题完全符合组合优化问题(COP),这是在大多数情况下NP-难最优解决。为了避免这个困难,我们选择了使用元启发式流行的方法,这是遗传算法,解决这个问题,在具体的情况下。所取得的结果表明了我们的方法的有效性,这种方法到目前为止仍然是非常昂贵的。但是,我们计划在下一步的工作中通过不同的方法来减少时间。

英文摘要:

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 NP-hard 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑