DocumentCode
2027989
Title
Computational methods through genetic algorithms for obtaining Stackelberg solutions to two-level zero-one programming problems
Author
Nishizaki, I. ; Sakawa, M. ; Kato, K.
Author_Institution
Dept. of Ind. & Syst. Eng., Hiroshima Univ., Japan
Volume
4
fYear
2000
fDate
2000
Firstpage
2750
Abstract
We develop computational methods through genetic algorithms for obtaining Stackelberg solutions to two-level zero-one programming problems. To demonstrate the feasibility and efficiency of the proposed methods, computational experiments are carried out and comparisons between the J.F. Bard and J.T. Moore (1990) method based on the implicit enumeration techniques and the proposed methods are provided
Keywords
genetic algorithms; mathematical programming; tree searching; Stackelberg solutions; computational experiments; computational methods; genetic algorithms; implicit enumeration techniques; two-level zero-one programming problems; Computer industry; Genetic algorithms; Genetic engineering; Linear programming; Mathematical programming; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Electronics Society, 2000. IECON 2000. 26th Annual Confjerence of the IEEE
Conference_Location
Nagoya
Print_ISBN
0-7803-6456-2
Type
conf
DOI
10.1109/IECON.2000.972433
Filename
972433
Link To Document