Bilevel Programming Solution by Genetic Algorithms
Publish place: 1st Nationall Industrial Engineering Conference
Publish Year: 1380
Type: Conference paper
Language: English
View: 2,718
This Paper With 19 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
Export:
Document National Code:
IIEC01_025
Index date: 6 October 2006
Bilevel Programming Solution by Genetic Algorithms abstract
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.
Bilevel Programming Solution by Genetic Algorithms Keywords:
Bilevel Programming Solution by Genetic Algorithms authors
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
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :