Volume 19, Issue 2 (1-2001)                   JCME 2001, 19(2): 65-78 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

S. R. Hejazi, A. Memariani and G. R. Jahanshahloo. Simulated Annealing Approach for Solving Bilevel Programming Problem. JCME. 2001; 19 (2) :65-78
URL: http://jcme.iut.ac.ir/article-1-198-en.html
Abstract:   (2615 Views)
Bilevel programming, a tool for modeling decentralized decision problems, 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 an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. In this paper, attempts have been made to develop an algorithm based on Simulated Annealing (SA) Approach. This algorithm is efficient enough to find a near optimal solution. The proposed method is compared with the one developed by Mathieu et al [1] through application of both to a number of different problems.
Keywords: -
Full-Text [PDF 804 kb]   (376 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25

Add your comments about this article : Your username or Email:
CAPTCHA code

© 2019 All Rights Reserved | Computational Methods in Engineering

Designed & Developed by : Yektaweb