An Evolutionary Algorithm for Solving Nonlinear Bilevel Programming Based on a New Constraint-Handling Scheme  

Oleh:

Wang, Yuping ; Jiao, Yong-Chang

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Systems, Man, and Cybernetics: Part C Applications and Reviews vol. 35 no. 2 (May 2005), page 221-232.
Topik: Constraint Handling; Evolutionary Algorithm (EA); Global Optimization; Nonlinear Bilevel Programming.

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II69.1 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

In this paper, a special nonlinear bilevel programming problem (nonlinear BLPP) is transformed into an equivalent single objective nonlinear programming problem. To solve the equivalent problem effectively, we first construct a specific optimization problem with two objectives. By solving the specific problem, we can decrease the leader's objective value, identify the quality of any feasible solution from infeasible solutions and the quality of two feasible solutions for the equivalent single objective optimization problem, force the infeasible solutions moving toward the feasible region, and improve the feasible solutions gradually. We then propose a new constraint-handling scheme and a specific-design crossover operator. The new constraint-handling scheme can make the individuals satisfy all linear constraints exactly and the nonlinear constraints approximately. The crossover operator can generate high quality potential offspring. Based on the constraint-handling scheme and the crossover operator, we propose a new evolutionary algorithm and prove its global convergence. A distinguishing feature of the algorithm is that it can be used to handle nonlinear BLPPs with nondifferentiable leader's objective functions. Finally, simulations on 31 benchmark problems, 12 of which have nondifferentiable leader's objective functions, are made and the results demonstrate the effectiveness of the proposed algorithm.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali