Computational methods through genetic algorithms for obtaining Stackelberg solutions to two-level integer programming problems

Cybernetics and Systems

Volumn 36, Issue 6, 2005, Pages 565-579

  Nishizaki, Ichiro ^a   Sakawa, Masatoshi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; DECISION MAKING; GENETIC ALGORITHMS; PROBLEM SOLVING;

ARTIFICIAL GENETIC SYSTEMS; NATURAL SELECTION; STACKELBERG SOLUTION;

INTEGER PROGRAMMING;

EID: 23744494204     PISSN: 01969722     EISSN: None     Source Type: Journal    
DOI: 10.1080/01969720590961718     Document Type: Article

References (15)

1. Anandalingam, G., R. Mathieu, C. L. Pittard, and N. Sinha. 1989. Artificial intelligence based approaches for solving hierarchical optimization problems. In Impacts of recent computer advances on operations research, edited by R. Sharda, B. L. Golden, E. Wasil, O. Balci, and W. Stewart. Amsterdam: North-Holland, pp. 289-301.
2. Bard, J. F. 1983. An efficient point algorithm for a linear two-stage optimization problem. Operations Research, 38:556-560.
3. Bard, J. F. and J. E. Falk. 1982. An explicit solution to the multi-level programming problem. Computers and Operations Research, 9:77-100.
4. Bard, J. F. and J. T. Moore. 1992. An algorithm for the discrete bilevel programming problem. Naval Research Logistics, 39:419-435.
5. Bialas, W. F. and M. H. Karwan. 1984. Two-level linear programming. Management Science, 30:1004-1020.
6. Fortuny-Amat, J. and B. McCarl. 1981. A representation and economic interpretation of a two-level programming problem. Journal of the Operational Research Society, 32:783-792.
7. Goldberg, D. E. 1989. Genetic algorithms in search, optimization, and machine learning. Reading, Massachusetts: Addison Wesley.
8. Hansen, P., B. Jaumard, and G. Savard. 1992. New branch-and-bound rules for liner bilevel programming. SIAM Journal of Scientific and Statistical Computing, 13:1194-1217.
9. Michalewicz, Z. 1996. Genetic algorithms + data structures = evolution programs. Third, revised and extended edition. Berlin: Springer-Verlag.
10. Moore, J. T. and J. F. Bard. 1990. The mixed integer liner bilevel programming problem. Operations Research, 38:911-921.
11. Nishizaki, I. and M. Sakawa. 2000. Computational methods through genetic algorithms for obtaining Stackelberg solutions to two-level mixed zero-one programming problems. Cybernetics and Systems: An International Journal, 31:203-221.
12. Nishizaki, I., M. Sakawa, K. Niwa, and Y. Kitaguchi. 2000. A computational method through genetic algorithms for obtaining Stackelberg solutions to two-level linear programming problems. The Transactions of the Institute of Electronics, Information and Communication Engineers A, J83-A:868-874.
13. Shimizu, K., Y. Ishizuka, and J. F. Bard. 1997. Nondifferentiable and two-level mathematical programming. Boston: Kluwer Academic Publishers.
14. Wen, U.-P. and Y. H. Yang. 1990. Algorithms for solving the mixed integer two-level linear programming problem. Computers and Operations Research, 17:133-142.
15. White, D. J. and G. Anandalingam. 1993. A penalty function approach for solving bi-level linear programs. Journal of Global Optimization, 3:397-419.