Volume 22, Issue 3 (IJIEPM 2011)                   2011, 22(3): 243-252 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
VahediNori B, Kianpour M, Fattahi P. Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem. Journal title 2011; 22 (3) :243-252
URL: http://ijiepm.iust.ac.ir/article-1-732-en.html
Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Behdin VahediNori , Mojahed Kianpour , Parviz Fattahi *
Associate professor of Industrial Eng-Bu-Ali Sina University , fattahi@basu.ac.ir
Abstract:   (4642 Views)

  Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this study, GRASP is used to solve the QAP problem. The resulting on QAP library standard problem is used to demonstrate the high performance of suggested algorithm .

Keywords: Greedy Randomized Adaptive search producer, Quadratic Assignment Problem, Meta-heuristic
Full-Text [PDF 2965 kb]   (2318 Downloads)    
Type of Study: Research | Subject: Other related Industrial and production reserach subjects in which has direct relation to the state-of-the art of the IE
Received: 2011/12/11 | Accepted: 2013/07/15 | Published: 2013/07/15
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.