سال انتشار: ۱۳۸۰

محل انتشار: اولین کنفرانس ملی مهندسی صنایع

تعداد صفحات: ۱۹

نویسنده(ها):

HEJAZI – Department of Industrial Engineering, Tarbiat Modarres University, Tehran, Iran
MEMARIANI – Department of Industrial Engineering, Tarbiat Modarres University, Tehran, Iran
JAHANSHAHLOO – Department of Mathematics, Teacher Training University, Tehran, Iran
SEPEHRI – Department of Mathematics, Teacher Training University, Tehran, Iran

چکیده:

Bilevel programming, a tool for modeling decentralized decisions consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be a Np_hard problem. Numerous algorithms have been developed so far for solving
bilevel programming problem. In this paper an attempt has been made to develop an efficient approach based on genetic algorithms (GAs).
The efficiency of the algorithm is ascertained by comparing the results with Gendreau, et al. [11] method.