检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北大学信息科学与工程学院,沈阳110004
出 处:《计算机工程与应用》2005年第4期9-11,194,共4页Computer Engineering and Applications
基 金:国家自然基金资助项目(编号:70171056)
摘 要:研究了电子中介处理个人之间单件物品交易时的多属性匹配问题。建立了多目标匹配模型,推导了用理想点法求解该模型时,求解其一次距离最小等价于求解原各目标相应系数直接相加所得的单目标指派问题。用有指导随机搜索算法求解了距理想点的二次距离最小。仿真实验表明,变量规模小于65时可以求二次距离最小并得到满意解;而大于65时求一次距离最小更为合适。The purpose of this paper is to research the multi-attribute matching problem of electronic broker when it is used in the C2C single commodity exchanging market,and a multi-objective mathematical model is constructed.It is verified that,when using the ″ideal solution method″,minimizing the Hamming Distance between final solution and the ideal solution equals optimizing the single objective assignment problem whose coefficient is the sum of all the coefficients of the previous objectives.A guided stochastic searching algorithm is used to solve the minimum Euclidean Distance.Experiments in real estate market show that,when the variable size is under 65,people can use the Euclidean Distance model,when over 65,Hamming Distance model is appropriate.
分 类 号:TP29[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249