TABU SEARCH APPROACH FOR SOLVING BILEVEL PROGRAMMING PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

HEJAZI S.R.; MEMARIANI A.; SEPEHRI M.M.; JAHANSHAHLOU GHOLAM REZA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Year:2001 | Volume:35 | Issue:2 (72) Page(s): 197-207

Download Full-Text

Persian Verion

View:

1,898

Download:

Cites:

Information Journal Paper

Title

TABU SEARCH APPROACH FOR SOLVING BILEVEL PROGRAMMING PROBLEM

Author(s)

HEJAZI S.R. | MEMARIANI A. | SEPEHRI M.M. | JAHANSHAHLOU GHOLAM REZA | Issue Writer Certificate

Keywords

Not Registered.

Abstract

Bilevel programming, a tool for modeling decentralized decision problem, 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 Np hard problem. Numerous algorithms have been developed for solving bilevel programming problem. These algorithms have not enough efficiency for solving a real problem. In this paper an attempt has been made to develop an algorithm based on Tabu Search (TS) approach. This algorithm can be efficient to finding a near optimal solution. In this paper, the proposed method and that of Mathieu and et.al [1] are also compared by solving different problems.

Cites

No record.

References

No record.

Cite

APA: Copy

HEJAZI, S.R., MEMARIANI, A., SEPEHRI, M.M., & JAHANSHAHLOU, GHOLAM REZA. (2001). TABU SEARCH APPROACH FOR SOLVING BILEVEL PROGRAMMING PROBLEM. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), 35(2 (72)), 197-207. SID. https://sid.ir/paper/14135/en

Vancouver: Copy

HEJAZI S.R., MEMARIANI A., SEPEHRI M.M., JAHANSHAHLOU GHOLAM REZA. TABU SEARCH APPROACH FOR SOLVING BILEVEL PROGRAMMING PROBLEM. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN)[Internet]. 2001;35(2 (72)):197-207. Available from: https://sid.ir/paper/14135/en

IEEE: Copy

S.R. HEJAZI, A. MEMARIANI, M.M. SEPEHRI, and GHOLAM REZA JAHANSHAHLOU, “TABU SEARCH APPROACH FOR SOLVING BILEVEL PROGRAMMING PROBLEM,” JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), vol. 35, no. 2 (72), pp. 197–207, 2001, [Online]. Available: https://sid.ir/paper/14135/en

Related Journal Papers