首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于全局搜索算法的不平衡指派问题研究
引用本文:房茂燕,汪民乐,毕义明,郭慧.基于全局搜索算法的不平衡指派问题研究[J].数学的实践与认识,2013,43(3).
作者姓名:房茂燕  汪民乐  毕义明  郭慧
作者单位:1. 第二炮兵工程大学数学与军事运筹教研室,陕西西安,710025
2. 第二炮兵驻159厂军事代表室,北京,100074
摘    要:目前求解不平衡指派问题的主要是将其转化为平衡的指派问题后再去处理.针对不平衡指派问题提出了全局搜索算法,算法不用将不平衡问题转化为平衡问题进行求解,而是基于全局最优策略对任务进行指派,方法理论更加简单,操作更加方便,使得不平衡指派问题得到了很好地解决,同时,这种算法对平衡指派问题、运输问题等依然有效.

关 键 词:全局搜索  指派  代价矩阵

Searching all Algorithm for the no Balance Assignment Problem
FANG Mao-yan , WANG Min-le , BI Yi-ming , GUO Hui.Searching all Algorithm for the no Balance Assignment Problem[J].Mathematics in Practice and Theory,2013,43(3).
Authors:FANG Mao-yan  WANG Min-le  BI Yi-ming  GUO Hui
Abstract:The No Balance Assignment Problem(NBAP) is mainly deal with by changing it into Balance Assignment Problem(BAP) and using classical algorithm to deal with it now. This paper proposed the Searching All Sates Algorithm(SASA) to resolve this problem,and it needn't to change NBAP into BAP.SASA resolves NBAP based on searching the best answers of the cost matrix.This algorithm's theory is simple and it is easy to operate.The study found out that the algorithm not only can deal with NBAP,but also can deal with BAP and other problems such as translation problem.
Keywords:overall situation searching  assignment problem  cost matrix
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号