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

摘要

We develop computational methods through genetic algorithms for obtaining Stackelberg solutions to two-level zero-one programming problems. Th demonstrate the feasibility and efficiency of the proposed methods, computational experiments are carried out and comparisons between the Bard and Moore method based on the implicit enumeration techniques and the proposed methods are provided.