A new recombination operator for the genetic algorithm solution of the quadratic assignment problem

Procedia Computer Science

Volumn 32, Issue , 2014, Pages 29-36

  Tosun, Umut ^a  

^a BASKENT UNIVERSITY   (Turkey)

Author keywords

Genetic Algorithm; Optimization; Order 1 Crossover; Quadratic Assignment Problem

Indexed keywords

CHROMOSOMES; ENERGY CONSERVATION; GENETIC ALGORITHMS; OPTIMIZATION; SORTING; TABU SEARCH;

COMBINATORIAL OPTIMIZATION PROBLEMS; DISTRIBUTED DATABASE; NEAR-OPTIMAL SOLUTIONS; ORDER-1 CROSSOVER; PARTITIONING ALGORITHMS; QUADRATIC ASSIGNMENT PROBLEMS; RECOMBINATION OPERATORS; WEAPON-TARGET ASSIGNMENT;

COMBINATORIAL OPTIMIZATION;

EID: 84902687819     PISSN: 18770509     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/j.procs.2014.05.394     Document Type: Conference Paper

References (27)

1. D. W. Pentico, "Assignment problems: a golden anniversary survey, " European Journal of Operational Research, vol. 176, no. 4, pp. 774-793, 2007.
2. R. E. Burkard and E. Cela, "Linear assignment problems and extensions, " In Pardalos, P. and Du, D.-Z. (eds), Handbook of Combinatorial Optimization, Kluwer Academic Publishers, Supplement vol. A, pp. 75-149, 1999.
3. T. C. Koopmans and M. J Beckmann, "Assignment problems and the location of economic activities, " Econometrica, vol. 25, no. 1, pp. 53-76, 1955.
4. L. Steinberg, "The backboard wiring problem: A placement algorithm, " SIAM Review, vol.3, no. 1, pp. 37-50, 1961.
5. D. F. Rossin, M. C. Springer, and B. D. Klein, "New complexity measures for the facility layout problem: An empirical study using traditional and neural network analysis, " Computers and Industrial Engineering, vol. 36, no. 3, pp. 585-602, 1999.
6. G. F. Pfister, In Search of Clusters (2nd Edition). Prentice Hall, 1998.
7. M. H. Lim, Y. Yuan, and S. Omatu, "Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem, " Computational Optimization and Applications, vol. 15, no. 3, pp. 249-268, 2000. (Pubitemid 30585303)
8. R. K. Adl and S. M. T. R Rankoohi, "A new ant colony optimization based algorithm for data allocation problem in distributed databases, " Knowledge Information Systems, vol. 20, no. 3, pp. 349-373, 2009.
9. J-F. Cordeau, M. Gaudioso, G. Laporte, L. Moccia, "The service allocation problem at the Gioia Tauro Maritime Terminal, " European Journal of Operational Research, vol. 176, no. 2, pp. 1167-1184, 2007. (Pubitemid 44537604)
10. S. Sahni and T. Gonzalez, "P-complete approximation problems, " Journal of the Association for the Computing Machinery, vol. 23, no. 3, pp. 555-565, 1976.
11. M. R. Wilhelm, "Solving quadratic assignment problems by simulated annealing, " IIE Transactions, vol. 19, no. 1, pp. 107-119, 1987.
12. D. T. Connolly, "An improved annealing scheme for the QAP, " European Journal of Operational Research, vol. 46, no. 1, pp. 93-100, 1990.
13. C. Calzon-Bousono, "The hopfield neural network applied to the quadratic assignment problem, " Neural Computing and Applications, vol. 3, no. 2, pp. 64-72, 1995.
14. J. P. Cohoon and W. D. Paris, "Genetic placement, " IEEE Transactions on Computer-Aided Design, vol. 6, no. 6, pp. 956-964, 1987.
15. D. M. Tate and A. E. Smith, "A genetic approach to the quadratic assignment problem, " Computers and Operations Research, vol. 22, no. 1, pp. 73-83, 1995.
16. U. Tosun, A. Cosar, T. Dokeroglu, "A Robust Island Parallel Genetic Algorithm for the Quadratic Assignment Problem", International Journal of Production Research, vol 51, pg 4117, 2013.
17. Y. Li, P. M. Pardalos, and M. G. C. Resende, "A greedy randomized adaptive search procedure for the quadratic assignment problem, " Quadratic assignment and related problems, P. M. Pardalos and H. Wolkowicz, eds., DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 237-261, 1994.
18. R. Battiti and G. Tecchiolli, "The reactive tabu search, " ORSA Journal on Computing, vol. 6, no. 2, pp. 126-140, 1994.
19. L. M. Gambardella, E. D. Taillard, and M. Dorigo, "Ant colonies for the quadratic assignment problem, " Journal of the Operational Research Society, vol. 50, no. 2, pp. 167-176, 1999.
20. E. Taillard, "Robust taboo search for the quadratic assignment problem, " Parallel Computing, vol. 17, no. 4-5, pp. 443-455, 1991. (Pubitemid 21695811)
21. R. E. Burkard, S. E. Karisch, and F. Rendl, "QAPLIB a quadratic assignment problem library, " European Journal of Operational Research, vol. 55, no. 1, pp. 115-119, 1991.
22. A. Misevicius, "A tabu search algorithm for the quadratic assignment problem, " Computational Optimization and Applications, vol. 30, no. 1, pp. 95-111, 2005.
23. R. K. Ahuja, and J. B. Orlin, A. Tiwari, "A greedy genetic algorithm for the Quadratic Assignment Problem, " Computers and Operations Research, vol. 27, no. 10, 917-934, 2000.
24. Z. Drezner, "The extended concentric tabu for the quadratic assignment problem, " European Journal of Operational Research, vol. 160, no. 2, pp. 416-422, 2005
25. Z. Drezner, "A new genetic algorithm for the quadratic assignment problem, " INFORMS Journal on Computing, vol. 15, no. 3, pp. 320-330, 2003. (Pubitemid 39042724)
26. Eiben, A.E. and Smith, J.E., 2003. Introduction to evolutionary computing, Springer.
27. C.A.R. Hoare, Quicksort, Computer Journal, 5(1):10-15, 1962.