Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem

1 ABSTRACT 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.

[1]  Shahin Gelareh,et al.  A Survey of MetaHeuristic Solution Methods for the Quadratic Assignment Problem , 2007 .

[2]  Rong Long Wang,et al.  Solving Facility Layout Problem Using an Improved Genetic Algorithm , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[3]  Jadranka Skorin-Kapov,et al.  Extensions of a tabu search adaptation to the quadratic assignment problem , 1994, Comput. Oper. Res..

[4]  Alfonsas Misevičius,et al.  An improved hybrid optimization algorithm for the quadratic assignment problem , 2005 .

[5]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[6]  Nair Maria Maia de Abreu,et al.  A survey for the quadratic assignment problem , 2007, Eur. J. Oper. Res..

[7]  Shahin Gelareh,et al.  A Survey of Meta-Heuristic Solution Methods for the Quadratic Assignment Problem , 2007 .

[8]  E. Shayan,et al.  Facilities layout design by genetic algorithms , 1998 .

[9]  Zvi Drezner,et al.  The extended concentric tabu for the quadratic assignment problem , 2005, Eur. J. Oper. Res..

[10]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[11]  Adl Baykasoğlu.  A meta-heuristic algorithm to solve quadratic assignment formulations of cell formation problems without presetting number of cells , 2004, J. Intell. Manuf..

[12]  Günter Radons,et al.  Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem , 2005, Eur. J. Oper. Res..

[13]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..