Computational methods through genetic algorithms for obtainingStackelberg solutions to two-level zero-one programming problems

摘要

We develop computational methods through genetic algorithms forobtaining Stackelberg solutions to two-level zero-one programmingproblems. To demonstrate the feasibility and efficiency of the proposedmethods, computational experiments are carried out and comparisonsbetween the J.F. Bard and J.T. Moore (1990) method based on the implicitenumeration techniques and the proposed methods are provided