Genetic algorithm for non-linear mixed integer programming problems and its applications

被引:161
作者
Yokota, T
Gen, M
Li, YX
机构
[1] Dept. of Indust. and Syst. Eng., Ashikaga Institute of Technology
关键词
D O I
10.1016/0360-8352(96)00041-1
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper we propose a method for solving non-linear mixed integer programming (NMIP) problems using genetic algorithm (GAs) to get an optimal or near optimal solution. The penalty function method was used to evaluate those infeasible chromosomes generated from genetic reproduction. Also, we apply the method for solving several optimization problems of system reliability which belong to non-linear integer programming (NIP) or (NMIP) problems, using the proposed method. Numerical experiments and comparisons with previous works are illustrated to demonstrate the efficiency of the proposed method. Copyright (C) 1996 Elsevier Science Ltd
引用
收藏
页码:905 / 917
页数:13
相关论文
共 27 条
[1]  
[Anonymous], P 3 IIE RES C
[2]  
BEAN JC, 1992, 9253 U MICH DEP IND
[3]  
COIT DW, IN PRESS IEEE T RELI
[4]   A TREE-SEARCH ALGORITHM FOR MIXED INTEGER PROGRAMMING-PROBLEMS [J].
DAKIN, RJ .
COMPUTER JOURNAL, 1965, 8 (03) :250-253
[5]  
DHINGRA AK, 1992, IEEE T RELIAB, P576
[6]  
Gen M., 1988, Transactions of the Institute of Electronics, Information and Communication Engineers D, VJ71D, P2140
[7]  
Gen M., 1994, P 10 FUZZ SYST S, P181
[8]  
Gen M, 1996, GENETIC ALGORITHMS E
[9]   CONVERTING 0-1 POLYNOMIAL PROGRAMMING PROBLEM TO A 0-1 LINEAR PROGRAM [J].
GLOVER, F ;
WOOLSEY, E .
OPERATIONS RESEARCH, 1974, 22 (01) :180-182
[10]  
Goldberg DE, 1989, GENETIC ALGORITHMS S