Journal
CYBERNETICS AND SYSTEMS
Volume 31, Issue 2, Pages 203-221Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/019697200124892
Keywords
-
Categories
Ask authors/readers for more resources
In this paper, we develop computational methods for obtaining Stackelberg solutions to two-level mixed zero-one programming problems in which the decision maker at the upper level controls zero-one variables and the decision maker at the lower level controls real variables. To illustrate two-level mixed zero-one programming problems, we formulate a facility location and transportation problem as a two-level mixed zero-one programming problem. We develop computational methods through genetic algorithms for obtaining Stackelberg solutions. To demonstrate the feasibility and efficiency of the proposed methods, computational experiments are carried out and comparisons between the methods based on the branch-and-bound techniques and the proposed methods are provided.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available