In the recent years, the bi-level programming problem (BLPP) is interested by many researchers and it is known as an appropriate tool to solve the real problems in several areas such as economic, traffic, finance, management, and so on. Also, it has been proven that the general BLPP is an NP-hard problem. The literature shows a few attempts for using influence methods. In this paper, we attempt to develop two effective approaches, one based on genetic and the other based on the hybrid algorithm by combining the penalty function and the line search algorithm for solving the non-linear BLPP. In these approaches, by using the Karush-Kuhn-Tucker conditions the BLPP is converted to a non-smooth single problem, and then it is smoothed by Fischer-Burmeister functions. Finally, the smoothed problem is solved using both of the proposed approaches. The presented approaches achieve an efficient and feasible solution in an appropriate time which has been evaluated by comparing to references and test problems
