一种基于弱偏好序信息的双边匹配决策方法  

Method for two-sided matching decision-making based on the weak preference ordering information

作　　者：梁海明[1] 姜艳萍[1] 

机构地区：[1]东北大学工商管理学院,辽宁沈阳110004

出　　处：《系统工程学报》2014年第2期153-159,共7页Journal of Systems Engineering

基　　金：国家创新研究群体科学基金资助项目(71021061);国家自然科学基金资助项目(71271050);高等学校博士学科点专项科研基金资助项目(20110042110011);中央高校基本业务科研经费专项基金资助项目(N110606001)

摘　　要：针对匹配主体给出弱偏好序形式信息的双边匹配决策问题,提出了一种决策分析方法.给出稳定满意和满意稳定匹配方案的定义;根据匹配主体给出的弱偏好序信息,计算一方匹配主体对另一方匹配主体的满意度;在稳定性约束的基础上,建立了以匹配主体双边满意度最大为目标的优化模型.针对所建立的多目标0-1线性规划模型的特点,设计了模型求解的变步长算法.通过求解模型确定最优匹配方案.最后,给出实例验证所提方法的可行性和有效性.For the two-sided matching decision making problem using the matching parties＇ weak preference ordering information, a decision-making analysis method is proposed. The definitions of the stability, satisfaction and stability satisfaction for the matching alternative are given. According to the matching party＇s weak preference ordering information, one matching party＇s satisfaction degrees at the other matching party are calculated. Based on the stability constraint, an optimization model is constructed, where the two objectives are to maximize one matching party＇s satisfaction degrees and maximize the other matching party＇s satisfaction degrees, respectively. According to the characteristics of the model which belongs to a type of 0-1 linear programming model, a changeable step algorithm is designed to solve it, and then the matching alternative is obtained. Finally, a practical example is given to illustrate the feasibility and effectiveness of the proposed method.

关 键 词：双边匹配决策 弱偏好序 满意度 优化模型 匹配方案 

分 类 号：C934[经济管理—管理学]