| 双目标瓶颈指派问题的遗传算法 |
| |
| 引用本文： | 黄沙日娜,赵国亮,朱捷.双目标瓶颈指派问题的遗传算法[J].经济数学,2014(2):76-79. |
| |
| 作者姓名： | 黄沙日娜 赵国亮 朱捷 |
| |
| 作者单位： | 黑龙江科技大学理学院; |
| |
| 基金项目： | 黑龙江省教育厅科学技术项目(12543065) |
| |
| 摘 要： | 给出一种双目标瓶颈指派问题的新模型,本模型结合了决策者和工人两方面的因素,特别之处在于考虑到了工人对工作的排名偏好.进而,将双目标瓶颈指派问题转化为单目标规划,并设计了解此问题的遗传算法,算法的解均为双目标瓶颈指派问题的Pareto最优解.
|
| 关 键 词： | 双目标 瓶颈指派问题 遗传算法 Pareto最优解 |
Genetic Algorithm for Bi-Obj ective Bottleneck Assignment Problem |
| |
| HUANGSHA Ri-na,ZHAO Guo-liang,ZHU Jie.Genetic Algorithm for Bi-Obj ective Bottleneck Assignment Problem[J].Mathematics in Economics,2014(2):76-79. |
| |
| Authors: | HUANGSHA Ri-na ZHAO Guo-liang ZHU Jie |
| |
| Institution: | (School of Science, Heilongjiang University of Science and Technology , Harbin, Heilongjiang 150022, China) |
| |
| Abstract: | This paper proposed a new model of bi-obj ective bottleneck assignment problem,which considers the factor of decision maker and workers.Particularly,worker’s ranked preference of jobs is incorporated into the objective function. Further,the bi-obj ective bottleneck assignment problem was converted into a single obj ective programming,and a genetic algorithm was designed for this problem.The solution obtained by this algorithm is Pareto optimal solution of the bi-obj ective bottleneck assignment problem . |
| |
| Keywords: | bi-obj ective bottleneck assignment problem genetic algorithm Pareto optimal solution |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
