The genetic algorithm for 0-1 programming with linear constraints

Author

Sun, Yanfeng ; Wang, Zhongtuo

Author_Institution

Inst. of Syst. Eng., Dalian Univ. of Technol., China

fYear

1994

fDate

27-29 Jun 1994

Firstpage

559

Abstract

This paper suggests a new method for solving 0-1 programming problem with linear constraints by genetic algorithm. The existing way of handling such problem allows constraint violation at the expense of some penalty and meets some difficulties of choosing penalty parameter which affects directly numerical result and possible premature convergence. In order to improve this situation, a genetic algorithm for 0-1 programming with linear constraints is proposed. The basic line of this algorithm is that the constraints are to be satisfied by every trial point in the genetic algorithm. By using nonbinary code, the genetic operators are different from classical genetic algorithm. Computational results are compared with those of conventional method and possibility of parallel processing is discussed

Keywords

constraint handling; genetic algorithms; logic programming; 0-1 programming; genetic algorithm; linear constraints; nonbinary code; parallel processing; penalty parameter; premature convergence; Biological cells; Concurrent computing; Evolution (biology); Genetic algorithms; Genetic mutations; Insurance; Linear programming; Parallel programming; Probability distribution;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on

Conference_Location

Orlando, FL

Print_ISBN

0-7803-1899-4

Type

conf

DOI

10.1109/ICEC.1994.349999

Filename

349999