求解人力资源分配问题的多目标和声搜索算法  

Multi-objective Harmony Search Algorithm for Solving Human Resource Allocation Problem

作　　者：吴昊[1,2] 杨佳[1,2] 王会颖[1,2] 尹道明[1,2] 

机构地区：[1]合肥工业大学管理学院,安徽合肥230009 [2]教育部过程优化与智能决策重点实验室,安徽合肥230009

出　　处：《计算机技术与发展》2013年第2期65-68,72,共5页Computer Technology and Development

基　　金：国家"863"云制造主题项目(2011AA040501);国家自然科学基金资助项目(70871033);安徽省教育自然科学重点项目(KJ2011A006)

摘　　要：人力资源分配问题是将若干个人力资源合理分配给若干个工作任务,从而达到人力生产效率最大化与人力生产成本最小化。文中提出一种改进的多目标和声搜索(MOIHS)算法来求解人力资源分配问题。MOIHS算法是通过改变记忆考虑的选择机制与微调概率来改进基本的和声算法提高算法收敛稳定性,并采用快速非支配排序方法与建立动态拥挤的距离来获得一个分布良好的Pareto解集。在求解人力资源分配问题时,同时优化人力生产成本最小化与效率最大化两个目标,最后通过一个实例可以得到在解决该问题上多目标改进和声搜索算法优于多目标遗传算法,求出的解集也具有良好的分布性。The human resource allocation problem seeks to find the expected objectives by allocating the limited amount of resource to va- rious activates. In this paper,a new multi-objective improved harmony search （MOIHS） has been proposed and applied to human re- source allocation problem to simultaneously optimize two goals about the cost minimization and efficiency maximization. MOIHS im- proves the base harmony search by changing the selection mechanism of memory consideration and the fine-tuning probability. It also u- ses the rapid non-dominate sorting method and establishes the dynamic crowded distance to get a good distribution of Pareto solution set. The experiment results show that,the improved harmony search is better than genetic algorithm for multi-objective resource allocation problem,it is able to give a well distributed Pareto-optimal solution.

关 键 词：资源分配问题 多目标优化 和声搜索算法 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]