| 电子就业中介中的匹配研究 |
| |
| 引用本文： | 张振华,迟红娟,邵举平,魏新江,汪定伟.电子就业中介中的匹配研究[J].计算机工程与应用,2006,42(30):205-207. |
| |
| 作者姓名： | 张振华 迟红娟 邵举平 魏新江 汪定伟 |
| |
| 作者单位： | 鲁东大学交通学院,山东,烟台,264025;鲁东大学数学与信息学院,山东,烟台,264025;东北大学信息科学与工程学院,沈阳,110004 |
| |
| 摘 要： | 研究了电子就业中介中公司学生的双边匹配问题,并基于HR算法(医学院实习生与医院相互选择算法1])建立了电子就业中介的工作流程模型。以交易双方总满意度分别最大为目标,建立了多目标指派模型,从而解决了传统HR算法的匹配公平性问题。以等权重的线性加权方法将问题化为单目标求解。仿真实验表明,该多目标算法虽不能保证匹配稳定性2],但在匹配数量上优于HR算法。
|
| 关 键 词： | 电子商务 电子就业中介 双边匹配 多目标 HR算法 |
| 文章编号： | 1002-8331（2006）30-0205-03 |
| 收稿时间： | 2006-05-01 |
| 修稿时间： | 2006-05-01 |
Research on Matching Problem of Electronic Job-broker |
| |
| ZHANG Zhen-hua,CHI Hong-juan,SHAO Ju-ping,WEI Xin-jiang,WANG Ding-wei.Research on Matching Problem of Electronic Job-broker[J].Computer Engineering and Applications,2006,42(30):205-207. |
| |
| Authors: | ZHANG Zhen-hua CHI Hong-juan SHAO Ju-ping WEI Xin-jiang WANG Ding-wei |
| |
| Affiliation: | 1.School of Traffic and Transportation, Ludong University, Y antai, Shandong 204025;2.School of Mathematics and Information, Ludong University,Yantai,Shandong 264025;3.School of Information Science and Engineering,Northeastern University,Shenyang 110004 |
| |
| Abstract: | The bipartite matching problem between companies and students of electronic job-broker is studied.Based on the HR(hospital-resident1]) algorithm,the broker’s operation process model is presented.In order to solve the matching fairness of traditional HR algorithm,a multi-objective assignment model is constructed whose objectives are to maximize each part’s total satisfactory degree.Giving each objective the same weight,we turn the multi-objective problem into a single objective problem.Simulation shows that this multi-objective model surpasses HR algorithm in matching number,though it’s stability2] is not very satisfying. |
| |
| Keywords: | electronic commerce electronic job-broker bipartite matching multi-objective HR algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
