Computational methods through genetic algorithms for obtaining Stackelberg solutions to two-level mixed zero-one programming problems

Cybernetics and Systems

Volumn 31, Issue 2, 2000, Pages 203-221

  Nishizaki, Ichiro ^a   Sakawa, Masatoshi ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; DECISION THEORY; GENETIC ALGORITHMS; PROBLEM SOLVING;

MIXED PROGRAMMING PROBLEMS; STACKELBERG SOLUTIONS;

COMPUTATIONAL METHODS;

EID: 0034161058     PISSN: 01969722     EISSN: None     Source Type: Journal    
DOI: 10.1080/019697200124892     Document Type: Article

References (18)

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, eds. R. Sharda, B. L. Golden, E. Wasil, O. Balci, and W. Stewart, 289-301. Amsterdam, The Netherlands: North-Holland.
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. 1990a. A branch and bound algorithm for the bilevel programming problem. SIAM J. Scientific and Statistical Computing 11:281-292.
5. Bard, J. F. and J. T. Moore. 1990b. The mixed integer linear bilevel programming problem. Operations Research 38:911-921.
6. Bard, J. F. and J. T. Moore. 1992. An algorithm for the discrete bilevel programming problem. Naval Research Logistics 39:419-435.
7. Bialas, W. F. and M. H. Karwan. 1984. Two-level linear programming. Management Science, 30:1004-1020.
8. Fortuny-Amat, J. and B. McCarl. 1981. A representation and economic interpretation of a two-level programming problem. J. Operational Research Society 32:783-792.
9. Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Adison-Wesley.
10. Goldberg, D. E. and R. Lingle. 1985. Alleles, loci, and the traveling salesman problem. In Proceedings of the 1st International Conference on Genetic Algorithms and Their Applications, Hillsdale, NJ: Lawrence Erlbaum Associates. 154-159.
11. Michalewicz, Z. 1996. Genetic Algorithms + Data Structures = Evolution Programs, 3rd revised extended ed. Berlin: Springer-Verlag.
12. Sakawa, M. K., Kato, H., Sunada, and T. Shibano. 1997. Fuzzy programming for multiobjective 0-1 programming problems through revised genetic algorithms. European J. Operational Research 97:149-158.
13. Sakawa, M. and T. Shibano. 1996. Interactive fuzzy programming for multiobjective 0-1 programming problems through genetic algorithms with double strings. In Fuzzy Logic Foundations and Industrial Applications, ed. Da Ruan, 111-128. Boston: Kluwer Academic Publishers.
14. Sakawa, M. and T. Shibano. 1997. Multiobjective fuzzy satisficing methods for 0-1 knapsack problems through genetic algorithms. Fuzzy Evolutionary Computation, ed. W. Pedrycs, 155-177. Boston: Kluwer Academic Publishers.
15. Shimizu, K., Y. Ishizuka, and J. F. Bard. 1997. Nondifferentiable and Two-Level Mathematical Programming. Boston: Kluwer Academic Publishers.
16. Vicente, L., G. Savard, and J. Judice. 1996. Discrete linear bilevel programming problem. J. Optimization Theory and Applications 89:597-614.
17. 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.
18. White, D. J. and G. Anandalingam. 1993. A penalty function approach for solving bi-level linear programs. J. Global Optimization 3:397-419.