A Scatter Search Based Approachfor the Quadratic Assignment
نویسندگان
چکیده
In this report, we are mainly interested in Scatter Search which is an evolutionary heuristic, proposed two decades ago, that uses linear combination of a population subset to create new solutions. A special operator is used to ensure their feasibility and to improve their quality. We propose hereafter a Scatter Search approach to the Quadratic Assignment Problem (QAP) problem. The basic method is extended with intensiication and diversiication stages and we present a procedure to generate good scattered initial solutions. Recherche Dispers ee pour le Probl eme de l'AAectation Quadratique R esum e : Dans ce rapport, nous nous int eressons a la \Recherche Dispers ee", une m ethode heuristique qualii ee d'\ evolutionniste" et propos ee il y a deux d ecennies par Fred Glover. La Recherche Dispers ee est fond ee principalement sur l'utilisation de la combinaison lin eaire d'un sous-ensemble d'une population pour engendrer de nouvelles solutions. Un op erateur sp ecial est egalement int egr e dans la m ethode aan d'assurer la r ealisabilit e et la qualit e des solutions. Nous proposons ci-apr es une approche de la Recherche Dispers ee pour le probl eme de l'AAectation Quadratique. La m ethode de base est enrichie des etapes d'intensiication et de diversiication. De m^ eme, une proc edure permettant d'engendrer des solutions initiales bien dispers ees est pr esent ee.
منابع مشابه
Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
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 stu...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملA Survey of Meta-Heuristic Solution Methods for the Quadratic Assignment Problem
The quadratic assignment problem (QAP) belongs to the class of NP-Hard problems and also is one of the hardest problems in this class. Today, regarding current hardware, solving the large size instances of this problem, using exact methods, is not possible in reasonable amount of time. In this way many heuristic (Meta-heuristic) and approximation methods and soft-computing approaches have been ...
متن کاملMigrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem
We propose a new nature inspired metaheuristic approach based on the V flight formation of the migrating birds which is proven to be an effective formation in energy saving. Its performance is tested on quadratic assignment problem instances arising from a real life problem and very good results are obtained. The quality of the solutions we report are better than simulated annealing, tabu searc...
متن کامل