DocumentCode
2244854
Title
A new hybrid genetic algorithm for global minimax optimization
Author
Longhua, Ma ; Zheng Yongling ; Jixin, Qian
Author_Institution
Inst. of Syst. Eng., Zhejiang Univ., Hangzhou, China
Volume
4
fYear
2001
fDate
2001
Firstpage
316
Abstract
The minimax problem is one of the branches of multilevel programming, but unfortunately there is lack of efficient algorithms for it. The paper discusses the convergence of all alternative methods at the beginning, and then presents the SGA (simplex-genetic algorithm), which is an improved algorithm of GA for solving Stackelberg-Nash equilibrium. Examples are provided to illustrate that SGA is an efficient and universal means for solving the minimax problem
Keywords
game theory; genetic algorithms; mathematical programming; minimax techniques; Stackelberg-Nash equilibrium; global minimax optimization; hybrid genetic algorithm; multilevel programming; simplex-genetic algorithm; Automation; Cities and towns; Convergence; Game theory; Genetic algorithms; Minimax techniques; Nash equilibrium; Optimization methods; Scattering; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Info-tech and Info-net, 2001. Proceedings. ICII 2001 - Beijing. 2001 International Conferences on
Conference_Location
Beijing
Print_ISBN
0-7803-7010-4
Type
conf
DOI
10.1109/ICII.2001.983838
Filename
983838
Link To Document