Abstract
In this paper, we describe an approach for solving the quadratic assignment problem (QAP) that is based on genetic algorithms (GA). It will be shown that a standard canonical GA (SGA), which involves genetic operators of selection, reproduction, crossover, and mutation, tends to fall short of the desired performance expected of a search algorithm. The performance deteriorates significantly as the size of the problem increases. To address this syndrome, it is common for GA-based techniques to be embedded with deterministic local search procedures. It is proposed that the local search should involve simple procedure of genome reordering that should not be too complex. More importantly, from a computational point of view, the local search should not carry with it the full cost of evaluating a chromosome after each move in the localized landscape. Results of simulation on several difficult QAP benchmarks showed the effectiveness of our approaches.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.E. Brownand A.R. Spillane, “Aparallel genetic heuristic for the quadratic assignment problem,” inICGA'89, pp. 406-415.
R.E. Burkard, “Quadratic assignment problems,” European Journal of Operational Research, vol. 15, pp. 283-289, 1984.
R.E. Burkard, “Locations with spatial interactions: The quadratic assignment problem,” in Discrete Location Theory, P.B. Mirchandani and R.L. Francis (Eds.), Wiley: New York, 1991, pp. 387-437.
R.E. Burkard and T. Bonniger, “A heuristic for quadratic boolean programs with applications to quadratic assignment problems,” European Journal of Operational Research, vol. 13, pp. 374-386, 1983.
R.E Burkard and U. Derigs, Assignment and Matching Problems: Solution Methods with FORTRAN-Programs, Springer-Verlag: Berlin, 1980. Lecture Notes in Economics and Mathematical Systems.
R.E. Burkard, S.E. Karisch, and F. Rendl, “QAPLIB-A Quadratic Assignment Problem Library,” Journal of Global Optimization, vol. 10, pp. 391-403, 1997 (URL:http://fmatbhp1.tu-graz.ac.at/~karisch/qaplib/).
R.E. Burkard and F. Rendl, “A thermodynamically motivated simulation procedure for combinatorial optimization problems,” European Journal of Operational Research, vol. 17, pp. 169-174, 1984.
P. Carraresi and F. Malucelli, “A new lower bound for the quadratic assignment problem,” Operations Research, vol. 40, Supp. no. 1, pp. S22-S27, 1992.
J. Chakrapani and J. Skorin-Kapov, “A connectionist approach to the quadratic assignment problem,” Computers & Operations Research, vol. 19, no. 3/4, pp. 287-295, 1992.
J. Clausen and M. Perregaard, “Solving large quadratic assignment problems in parallel,” Computational Optimization and Applications, vol. 8, pp. 111-127, 1997.
D.T. Connolly, “An improved annealing scheme for the QAP,” European Journal of Operational Research, vol. 46, pp. 93-100, 1990.
L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold: New York, 1991.
C. Fleurent and J. Ferland, “Genetic hybrids for the quadratic assignment problem,” in Quadratic Assignment and Related Problems, P. Pardalos and H. Wolkowicz (Eds.), AMS: Providence, Rhode Island, 1994, pp. 173-187, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16.
D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.
B.H. Gwee and M.H. Lim, “Polyominoes tiling by a genetic algorithm,” Computational Optimization and Applications, vol. 6, pp. 273-291, 1996.
A. Kapsalis, V.J. Rayward-Smith, and G.D. Smith, “Solving the graphical Steiner tree problem using genetic algorithms,” Journal of the Operational Research Society, vol. 44, no. 4, pp. 397-406, 1993.
O. Kettani and M. Oral, “Reformulating quadratic assignment problems for efficient optimization,” IIE Transactions, vol. 25, no. 6, pp. 97-107, 1993.
T.C. Koopmans and M.J. Beckmann, “Assignment problems and the location of economic activities,” Econometrica, vol. 25, pp. 53-76, 1957.
P.S. Laursen, “Simulated annealing for the QAP-Optimal tradeoff between simulation time and solution quality,” European Journal of Operational Research, vol. 69, pp. 238-243, 1993.
G. Levittin and J. Rubinovitz, “Genetic algorithm for linear and cyclic assignment problem,” Operations Research, vol. 20, no. 6, pp. 575-586, 1993.
Y. Li, P.M. Pardalos, and M. Resende, “A greedy randomized adaptive search procedure for the quadratic assignment problem,” in Quadratic Assignment and Related Problems, P. Pardalos and H. Wolkowicz (Eds.), AMS: Providence, Rhode Island, 1994, pp. 173-187, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16.
M.H. Lim, S. Rahardja, and B.H. Gwee, “A GA paradigm for learning fuzzy rules,” Fuzzy Sets and Systems, vol. 82, pp. 177-186, 1996.
T.D. Mavridou and P.M. Pardalos, “Simulated annealing and genetic algorithms for the facility layout problem: A survey,” Computational Optimization and Applications, vol. 7, pp. 111-126, 1997.
P.M. Pardalos and J.V. Crouse, “A parallel algorithm for the quadratic assignment problem,” Supercomputing Conference, 1989, pp. 351-360.
V.J. Rayward-Smith, Applications of Modern Heuristic Methods, University of East Anglia, Alfred Waller, 1995.
J. Skorin-Kapov, “Extensions of a tabu search adaptation to the quadratic assignment problem,” Computers & Operations Research, vol. 21, no. 8, pp. 855-865, 1994.
E. Taillard, “Robust taboo search for the quadratic assignment problem,” Parallel Computing, vol. 17, pp. 443-455, 1991.
D.M. Tate and A.E. Smith, “A genetic approach to the quadratic assignment problem,” Computers & Operations Research, vol. 22, no. 1, pp. 73-83, 1995.
D. Whitley, T. Starkweather, and D. Fuquay, “Scheduling problems and the travelling salesman: The genetic edge recombination operator,” in Proceedings of the Third International Conference on Genetic Algorithms and Their Applications, Morgan Kaufmann: San Mateo, Calif, 1989.
T. Yamada and R. Nakano, “A genetic algorithm applicable to large-scale job-shop problems,” in Parallel Problem Solving From Nature 2, R. Männer and B. Manderick (Eds.), North-Holland: Amsterdam, 1992, pp. 281-290.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lim, M., Yuan, Y. & Omatu, S. Efficient Genetic Algorithms Using Simple Genes Exchange Local Search Policy for the Quadratic Assignment Problem. Computational Optimization and Applications 15, 249–268 (2000). https://doi.org/10.1023/A:1008743718053
Issue Date:
DOI: https://doi.org/10.1023/A:1008743718053