摘要
给出了该类问题的数学模型,其约束的特殊性表现在被指派的资源数量必须在给定的范围内,因而不同于一般非平衡指派问题;运用m进制运算规则将二维解矩阵转化为一维解向量,减少解组合的数量,据此用隐枚举法求得问题的最优解。通过对多个算例的求解,找出了该问题最优解的两个特点。这些特点可为求解大规模该问题的智能算法提供有益的帮助。
A model is given for the problem. The difference between the problem and general non-balance assignment problems is its constrain with discarding some resources. According to M-Accumulative-Carry, the coefficient matrix is turned to a vector, so the amount of solution combinations is reduced distinctly. Optimal solutions for this problem are achievable based on the implicit enumeration method. Two characteristics are found by performing a lot of examples. These characteristics help to solve these large-scale problems by intellectual algorithms.
出处
《运筹与管理》
CSCD
北大核心
2010年第1期89-91,共3页
Operations Research and Management Science
关键词
特殊约束
指派问题
M进制
隐枚举法
special constrains
assignment problem
M-Accumulative-Carry
implicit enumeration
