The fuzzy quadratic assignment problem with penalty: New models and genetic algorithm

被引:39
|
作者
Liu, LZ [1 ]
Li, YZ
机构
[1] Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
[2] Lanzhou Jiaotong Univ, Inst Syst Engn, Lanzhou 730070, Peoples R China
基金
中国国家自然科学基金;
关键词
fuzzy set; assignment problem; genetic algorithm; quadratic assignment problem; credibility measure;
D O I
10.1016/j.amc.2005.06.012
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The assignment problem is to find the total costs optimal jobs assignment schedule where n jobs are allocated to n workers, and each worker receives exactly just one job, Such that the total cost is optimal. The quadratic assignment problem with penalty takes three types of costs into consideration: direct cost, interactive cost an penalty. In this paper, the fuzzy quadratic assignment problem with penalty is formulated as expected value model, chance-constrained programming and depenclent-chance programming according to various decision criteria, and the crisp equivalents are given. Furthermore, hybrid genetic algorithm is designed for solving the proposed fuzzy programming models. (c) 2005 Elsevier Inc. All rights reserved.
引用
收藏
页码:1229 / 1244
页数:16
相关论文
共 50 条