Abstract
ABSTRACT In this article, we present a method for obtaining Stackelberg solutions to two-level integer problems through genetic algorithms, which have received much attention as a promising computational method for complex problems. Assuming that there exist the upper- and the lower-bounds constraints with respect to integer variables, we employ a zero-one bit string as an individual in our artificial genetic systems. It is required that each individual satisfies the constraints of the given problem and a response of the lower level decision maker with respect to a decision that the upper level decision maker is rational. Therefore, individuals not satisfying the two conditions are penalized in the artificial genetic systems. To demonstrate the feasibility and efficiency of the proposed methods, computational experiments are carried out and comparisons between the Moore and Bard method based on the branch-and-bound techniques and the proposed methods are provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
