메뉴 건너뛰기




Volumn 2014-January, Issue , 2014, Pages 119-124

Hybrid metaheuristics for solving the quadratic assignment problem and the generalized quadratic assignment problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; SIMULATED ANNEALING; TABU SEARCH;

EID: 84939797262     PISSN: 21618070     EISSN: 21618089     Source Type: Conference Proceeding    
DOI: 10.1109/CoASE.2014.6899314     Document Type: Conference Paper
Times cited : (6)

References (23)
  • 1
    • 0036565412 scopus 로고    scopus 로고
    • Modeling and analysis of congestion in the design of facility layouts
    • Benjaafar, S. (2002). Modeling and analysis of congestion in the design of facility layouts. Management Science, 48(5), 679-704.
    • (2002) Management Science , vol.48 , Issue.5 , pp. 679-704
    • Benjaafar, S.1
  • 5
    • 4344642070 scopus 로고    scopus 로고
    • The extended concentric tabu for the quadratic assignment problem
    • Drezner, Z. (2005). The extended concentric tabu for the quadratic assignment problem. European Journal of Operational Research, 160, 416-422.
    • (2005) European Journal of Operational Research , vol.160 , pp. 416-422
    • Drezner, Z.1
  • 6
    • 25444476941 scopus 로고    scopus 로고
    • Recent advances for the QAP problem with special emphasis on instances that are difficult for metaheuristic methods
    • Drezner, Z., Hahn, P. M., & Taillard, É. D. (2005). Recent advances for the QAP problem with special emphasis on instances that are difficult for metaheuristic methods. Annals of Operations Research, 139, 65-94.
    • (2005) Annals of Operations Research , vol.139 , pp. 65-94
    • Drezner, Z.1    Hahn, P.M.2    Taillard, É.D.3
  • 7
    • 33746372113 scopus 로고    scopus 로고
    • The quadratic assignment problem in the context of the printed circuit board assembly process
    • Duman, E. & Ilhan, O. (2007). The quadratic assignment problem in the context of the printed circuit board assembly process. Computers & Operations Research, 34, 163-179.
    • (2007) Computers & Operations Research , vol.34 , pp. 163-179
    • Duman, E.1    Ilhan, O.2
  • 8
    • 1642603350 scopus 로고    scopus 로고
    • An extreme point algorithm for a local minimum solution to the quadratic assignment problem
    • Fedjki, C. A., & Duffuaa, S. O. (2004). An extreme point algorithm for a local minimum solution to the quadratic assignment problem. European Journal of Operational Research, 156(3), 566-578.
    • (2004) European Journal of Operational Research , vol.156 , Issue.3 , pp. 566-578
    • Fedjki, C.A.1    Duffuaa, S.O.2
  • 12
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • Kirkpatrick, S., Gellatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671-680.
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gellatt, C.D.2    Vecchi, M.P.3
  • 14
    • 0033906711 scopus 로고    scopus 로고
    • Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem
    • Lim, M. H., Yuan, Y., & Omatu, S. (2000). Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem. Computational Optimization and Applications, 15, 249-268.
    • (2000) Computational Optimization and Applications , vol.15 , pp. 249-268
    • Lim, M.H.1    Yuan, Y.2    Omatu, S.3
  • 15
    • 0036792824 scopus 로고    scopus 로고
    • Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems
    • Lim, M. H., Yuan, Y., & Omatu, S. (2002). Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems. Computational Optimization and Applications, 64, 47-64.
    • (2002) Computational Optimization and Applications , vol.64 , pp. 47-64
    • Lim, M.H.1    Yuan, Y.2    Omatu, S.3
  • 17
    • 80053575553 scopus 로고    scopus 로고
    • GRASP with path-relinking for the generalized quadratic assignment problem
    • Mateus, G. R., Resende, M. G. C., & Silva, R. M. A. (2011). GRASP with path-relinking for the generalized quadratic assignment problem. Journal of Heuristics, 17, 527-565.
    • (2011) Journal of Heuristics , vol.17 , pp. 527-565
    • Mateus, G.R.1    Resende, M.G.C.2    Silva, R.M.A.3
  • 18
    • 33749554535 scopus 로고    scopus 로고
    • An improved hybrid optimization algorithm for the quadratic assignment problem
    • Misevicius, A. (2004). An improved hybrid optimization algorithm for the quadratic assignment problem. Mathematical Modelling and Analysis, 9(2), 149-168.
    • (2004) Mathematical Modelling and Analysis , vol.9 , Issue.2 , pp. 149-168
    • Misevicius, A.1
  • 19
    • 77950022096 scopus 로고    scopus 로고
    • Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation0Linearization Technique
    • Pessoa, A. A., Hahn, P. M., Guignard, M., & Zhu, Y-R. (2010). Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation0Linearization Technique. European Journal of Operational Research, 206, 54-63.
    • (2010) European Journal of Operational Research , vol.206 , pp. 54-63
    • Pessoa, A.A.1    Hahn, P.M.2    Guignard, M.3    Zhu, Y.-R.4
  • 20
    • 77950188583 scopus 로고    scopus 로고
    • Analysis of the efficacy of a two-stage methodology for ant colony optimization: Case of study with TSP and QAP
    • Puris, A. Bello, R., & Herrera, F. (2010). Analysis of the efficacy of a two-stage methodology for ant colony optimization: case of study with TSP and QAP. Expert Systems with Applications, 37, 5443-5453.
    • (2010) Expert Systems with Applications , vol.37 , pp. 5443-5453
    • Puris Bello, A.R.1    Herrera, F.2
  • 21
    • 0030388443 scopus 로고    scopus 로고
    • Simulated annealing for the quadratic assignment problem: A further study
    • Tian, P., Wang, H. C., & Zhang, D. M. (1996). Simulated annealing for the quadratic assignment problem: a further study. Computers and Industrial Engineering, 31(3-4), 925-928.
    • (1996) Computers and Industrial Engineering , vol.31 , Issue.3-4 , pp. 925-928
    • Tian, P.1    Wang, H.C.2    Zhang, D.M.3
  • 22
    • 0029196165 scopus 로고
    • Some concave-convex representations of the quadratic assignment problem
    • White, D. J. (1995). Some concave-convex representations of the quadratic assignment problem. European Journal of the Operational Research, 80(2), 418-424.
    • (1995) European Journal of the Operational Research , vol.80 , Issue.2 , pp. 418-424
    • White, D.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.