메뉴 건너뛰기




Volumn 39, Issue , 2015, Pages 267-278

On the performance of parallel hybrid algorithms for the solution of the quadratic assignment problem

Author keywords

Ant colony algorithm; Genetic algorithms; Parallel hybrid algorithm; Quadratic assignment problem; Tabu search

Indexed keywords

ANT COLONY OPTIMIZATION; BENCHMARKING; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; POLYNOMIAL APPROXIMATION; TABU SEARCH;

EID: 84921825798     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2014.12.011     Document Type: Article
Times cited : (36)

References (68)
  • 1
    • 69949136449 scopus 로고    scopus 로고
    • A new ant colony optimization based algorithm for data allocation problem in distributed databases
    • R.K. Adl, and S.M.T.R. Rankoohi A new ant colony optimization based algorithm for data allocation problem in distributed databases Knowl. Inf. Syst. 20 3 2009 349 373
    • (2009) Knowl. Inf. Syst. , vol.20 , Issue.3 , pp. 349-373
    • Adl, R.K.1    Rankoohi, S.M.T.R.2
  • 2
    • 0034079265 scopus 로고    scopus 로고
    • A greedy genetic algorithm for the quadratic assignment problem
    • R.K. Ahuja, J.B. Orlin, and A. Tiwari A greedy genetic algorithm for the quadratic assignment problem Comput. Oper. Res. 27 10 2000 917 934
    • (2000) Comput. Oper. Res. , vol.27 , Issue.10 , pp. 917-934
    • Ahuja, R.K.1    Orlin, J.B.2    Tiwari, A.3
  • 4
    • 0036454519 scopus 로고    scopus 로고
    • Solving quadratic assignment problems using convex quadratic programming relaxations
    • K. Anstreicher, and N.W. Brixius Solving quadratic assignment problems using convex quadratic programming relaxations Optim. Methods Softw. 16 2001 49 68
    • (2001) Optim. Methods Softw. , vol.16 , pp. 49-68
    • Anstreicher, K.1    Brixius, N.W.2
  • 5
    • 0038823138 scopus 로고    scopus 로고
    • Solving large quadratic assignment problems on computational grids
    • K. Anstreicher, N.W. Brixius, J-P. Goux, and J. Linderoth Solving large quadratic assignment problems on computational grids Math. Program. 91 3 2002 563 588
    • (2002) Math. Program. , vol.91 , Issue.3 , pp. 563-588
    • Anstreicher, K.1    Brixius, N.W.2    Goux, J.-P.3    Linderoth, J.4
  • 6
    • 0000545145 scopus 로고
    • Parallel based search for combinatorial optimization genetic algorithms and TABU
    • R. Battiti, and G. Tecchiolli Parallel based search for combinatorial optimization genetic algorithms and TABU Microprocess. Microsyst. 16 7 1992 351 367
    • (1992) Microprocess. Microsyst. , vol.16 , Issue.7 , pp. 351-367
    • Battiti, R.1    Tecchiolli, G.2
  • 7
  • 8
    • 84871209039 scopus 로고    scopus 로고
    • Breakout local search for the quadratic assignment problem
    • U. Benlic, and J.K. Hao Breakout local search for the quadratic assignment problem Appl. Math. Comput. 219 9 2013 4800 4815
    • (2013) Appl. Math. Comput. , vol.219 , Issue.9 , pp. 4800-4815
    • Benlic, U.1    Hao, J.K.2
  • 9
    • 0000956123 scopus 로고    scopus 로고
    • Linear assignment problems and extensions
    • P. Pardalos, D.-Z. Du, Kluwer Academic Publishers Dordrecht
    • R.E. Burkard, and E. Cela Linear assignment problems and extensions P. Pardalos, D.-Z. Du, Handbook of Combinatorial Optimization Supplement vol. A 1999 Kluwer Academic Publishers Dordrecht 75 149
    • (1999) Handbook of Combinatorial Optimization , pp. 75-149
    • Burkard, R.E.1    Cela, E.2
  • 10
    • 0026418381 scopus 로고
    • QAPLIB a quadratic assignment problem library
    • R.E. Burkard, S.E. Karisch, and F. Rendl QAPLIB a quadratic assignment problem library Eur. J. Oper. Res. 55 1 1991 115 119
    • (1991) Eur. J. Oper. Res. , vol.55 , Issue.1 , pp. 115-119
    • Burkard, R.E.1    Karisch, S.E.2    Rendl, F.3
  • 11
    • 25444470514 scopus 로고
    • The hopfield neural network applied to the quadratic assignment problem
    • C. Calzon-Bousono The hopfield neural network applied to the quadratic assignment problem Neural Comput. Appl. 3 2 1995 64 72
    • (1995) Neural Comput. Appl. , vol.3 , Issue.2 , pp. 64-72
    • Calzon-Bousono, C.1
  • 12
    • 0006574134 scopus 로고
    • A new lower bound for the quadratic assignment problem
    • P. Carraresi, and F. Malucelli A new lower bound for the quadratic assignment problem Oper. Res. 40 1 1992 22 27
    • (1992) Oper. Res. , vol.40 , Issue.1 , pp. 22-27
    • Carraresi, P.1    Malucelli, F.2
  • 13
    • 0026852208 scopus 로고
    • A connectionist approach to the quadratic assignment problem
    • J. Chakrapani, and J. Skorin-Kapov A connectionist approach to the quadratic assignment problem Comput. Oper. Res. 19 3-4 1992 287 295
    • (1992) Comput. Oper. Res. , vol.19 , Issue.34 , pp. 287-295
    • Chakrapani, J.1    Skorin-Kapov, J.2
  • 14
    • 0031222460 scopus 로고    scopus 로고
    • Solving large quadratic assignment problems in parallel
    • J. Clausen, and M. Perregaard Solving large quadratic assignment problems in parallel Comput. Optim. Appl. 8 2 1997 111 127
    • (1997) Comput. Optim. Appl. , vol.8 , Issue.2 , pp. 111-127
    • Clausen, J.1    Perregaard, M.2
  • 16
    • 0025699777 scopus 로고
    • An improved annealing scheme for the QAP
    • D.T. Connolly An improved annealing scheme for the QAP Eur. J. Oper. Res. 46 1 1990 93 100
    • (1990) Eur. J. Oper. Res. , vol.46 , Issue.1 , pp. 93-100
    • Connolly, D.T.1
  • 17
    • 33749565621 scopus 로고    scopus 로고
    • The service allocation problem at the Gioia Tauro Maritime Terminal
    • J-F. Cordeau, M. Gaudioso, G. Laporte, and L. Moccia The service allocation problem at the Gioia Tauro Maritime Terminal Eur. J. Oper. Res. 176 2 2007 1167 1184
    • (2007) Eur. J. Oper. Res. , vol.176 , Issue.2 , pp. 1167-1184
    • Cordeau, J.-F.1    Gaudioso, M.2    Laporte, G.3    Moccia, L.4
  • 18
    • 3543110181 scopus 로고    scopus 로고
    • Parallel Strategies for Metaheuristics
    • F.W. Glover, G.A. Kochenberger, Kluwer Academic Publishers Norwell, MA, USA, Dordrecht
    • T.G. Crainic, and M. Touluse Parallel Strategies for Metaheuristics F.W. Glover, G.A. Kochenberger, Handbook of Metaheuristics 2003 Kluwer Academic Publishers Norwell, MA, USA, Dordrecht 475 513
    • (2003) Handbook of Metaheuristics , pp. 475-513
    • Crainic, T.G.1    Touluse, M.2
  • 19
    • 84884813524 scopus 로고    scopus 로고
    • An effective parallel multistart tabu search for quadratic assignment problem on CUDA platform
    • M. Czapinski An effective parallel multistart tabu search for quadratic assignment problem on CUDA platform J. Parallel Distrib. Comput. 73 2013 1461 1468
    • (2013) J. Parallel Distrib. Comput. , vol.73 , pp. 1461-1468
    • Czapinski, M.1
  • 21
    • 3242711972 scopus 로고    scopus 로고
    • A new genetic algorithm for the quadratic assignment problem
    • Z. Drezner A new genetic algorithm for the quadratic assignment problem INFORMS J. Comput. 15 3 2003 320 330
    • (2003) INFORMS J. Comput. , vol.15 , Issue.3 , pp. 320-330
    • Drezner, Z.1
  • 22
    • 4344642070 scopus 로고    scopus 로고
    • The extended concentric tabu for the quadratic assignment problem
    • Z. Drezner The extended concentric tabu for the quadratic assignment problem Eur. J. Oper. Res. 160 2 2005 416 422
    • (2005) Eur. J. Oper. Res. , vol.160 , Issue.2 , pp. 416-422
    • Drezner, Z.1
  • 25
    • 0001067326 scopus 로고
    • A parallel tabu search algorithm for large traveling salesman problems
    • C.N. Fiechter A parallel tabu search algorithm for large traveling salesman problems Discr. Appl. Math. 51 3 1994 243 267
    • (1994) Discr. Appl. Math. , vol.51 , Issue.3 , pp. 243-267
    • Fiechter, C.N.1
  • 26
  • 27
    • 0001703624 scopus 로고
    • Optimal and suboptimal algorithms for the quadratic assignment problem
    • P.C. Gilmore Optimal and suboptimal algorithms for the quadratic assignment problem J. Soc. Ind. Appl. Math. 10 2 1962 305 313
    • (1962) J. Soc. Ind. Appl. Math. , vol.10 , Issue.2 , pp. 305-313
    • Gilmore, P.C.1
  • 28
    • 0022865373 scopus 로고
    • Future paths for integer programming and links to artificial intelligence
    • F. Glover Future paths for integer programming and links to artificial intelligence Comput. Oper. Res. 13 5 1986 533 549
    • (1986) Comput. Oper. Res. , vol.13 , Issue.5 , pp. 533-549
    • Glover, F.1
  • 29
    • 0000411214 scopus 로고
    • Tabu search - Part 1
    • F. Glover Tabu search - Part 1 ORSA J. Comput. 1 2 1989 190 206
    • (1989) ORSA J. Comput. , vol.1 , Issue.2 , pp. 190-206
    • Glover, F.1
  • 30
    • 0001724713 scopus 로고
    • Tabu search - Part 2
    • F. Glover Tabu search - Part 2 ORSA J. Comput. 2 1 1990 4 32
    • (1990) ORSA J. Comput. , vol.2 , Issue.1 , pp. 4-32
    • Glover, F.1
  • 31
    • 77949587087 scopus 로고    scopus 로고
    • A template for scatter search and path relinking
    • J.-K. Hao, Springer-Verlag Nimes, France
    • F. Glover A template for scatter search and path relinking J.-K. Hao, Artificial Evolution, Lecture Notes in Computer Science vol. 1363 1998 Springer-Verlag Nimes, France 3 54
    • (1998) Artificial Evolution, Lecture Notes in Computer Science , vol.1363 , pp. 3-54
    • Glover, F.1
  • 33
    • 0035482725 scopus 로고    scopus 로고
    • A hospital facility layout problem finally solved
    • P. Hahn, and J. Krarup A hospital facility layout problem finally solved J. Intell. Manuf. 12 5-6 2001 487 496
    • (2001) J. Intell. Manuf. , vol.12 , Issue.56 , pp. 487-496
    • Hahn, P.1    Krarup, J.2
  • 35
    • 24344434662 scopus 로고    scopus 로고
    • Sequential and parallel pathrelinking algorithms for the quadratic assignment problem
    • T. James, C. Rego, and F. Glover Sequential and parallel pathrelinking algorithms for the quadratic assignment problem IEEE Intell. Syst. 20 4 2005 58 65
    • (2005) IEEE Intell. Syst. , vol.20 , Issue.4 , pp. 58-65
    • James, T.1    Rego, C.2    Glover, F.3
  • 36
    • 84921745773 scopus 로고    scopus 로고
    • Multi-Start Tabu Search and Diversification Strategies for the Quadratic Assignment Problem
    • James, T.; Rego, C.; Glover, F.; 2006. Multi-Start Tabu Search and Diversification Strategies for the Quadratic Assignment Problem. Working Paper Virginia Tech.
    • (2006) Working Paper Virginia Tech
    • James, T.1    Rego, C.2    Glover, F.3
  • 37
    • 56349104182 scopus 로고    scopus 로고
    • A cooperative parallel tabu search algorithm for the QAP
    • T. James, C. Rego, and F. Glover A cooperative parallel tabu search algorithm for the QAP Eur. J. Oper. Res. 195 3 2009 810 826
    • (2009) Eur. J. Oper. Res. , vol.195 , Issue.3 , pp. 810-826
    • James, T.1    Rego, C.2    Glover, F.3
  • 38
    • 0028517398 scopus 로고
    • A study of diversification strategies for the quadratic assignment problem
    • J.P. Kelly, M. Laguna, and F. Glover A study of diversification strategies for the quadratic assignment problem Comput. Oper. Res. 21 8 1994 885 893
    • (1994) Comput. Oper. Res. , vol.21 , Issue.8 , pp. 885-893
    • Kelly, J.P.1    Laguna, M.2    Glover, F.3
  • 39
    • 0002384937 scopus 로고
    • Assignment problems and the location of economic activities
    • T.C. Koopmans, and M.J. Beckmann Assignment problems and the location of economic activities Econometrica 25 1 1955 53 76
    • (1955) Econometrica , vol.25 , Issue.1 , pp. 53-76
    • Koopmans, T.C.1    Beckmann, M.J.2
  • 41
    • 0033397380 scopus 로고    scopus 로고
    • Intensification and diversification with elite tabu search solutions for the linear ordering problem
    • M. Laguna, R. Marti, and V. Campos Intensification and diversification with elite tabu search solutions for the linear ordering problem Comput. Oper. Res. 26 12 1999 1217 1230
    • (1999) Comput. Oper. Res. , vol.26 , Issue.12 , pp. 1217-1230
    • Laguna, M.1    Marti, R.2    Campos, V.3
  • 43
    • 0033906711 scopus 로고    scopus 로고
    • Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem
    • M.H. Lim, Y. Yuan, and S. Omatu Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem Comput. Optim. Appl. 15 3 2000 249 268
    • (2000) Comput. Optim. Appl. , vol.15 , Issue.3 , pp. 249-268
    • Lim, M.H.1    Yuan, Y.2    Omatu, S.3
  • 45
    • 84957805380 scopus 로고    scopus 로고
    • A dynamic-programming bound for the quadratic assignment problem
    • Marzetta, A.; Brungger, A.; 1999. A dynamic-programming bound for the quadratic assignment problem. In: Lecture Notes in Computer Science, vol. 1627, pp. 339-348.
    • (1999) Lecture Notes in Computer Science , vol.1627 , pp. 339-348
    • Marzetta, A.1    Brungger, A.2
  • 46
    • 0001092162 scopus 로고
    • A new exact algorithm for the solution of quadratic assignment problems
    • T. Mautor, and C. Roucairol A new exact algorithm for the solution of quadratic assignment problems Discr. Appl. Math. 55 3 1994 281 293
    • (1994) Discr. Appl. Math. , vol.55 , Issue.3 , pp. 281-293
    • Mautor, T.1    Roucairol, C.2
  • 47
    • 0038392552 scopus 로고    scopus 로고
    • Genetic algorithm hybridized with ruin and recreate procedure application to the quadratic assignment problem
    • A. Misevicius Genetic algorithm hybridized with ruin and recreate procedure application to the quadratic assignment problem Knowl.-Based Syst. 16 2003 261 268
    • (2003) Knowl.-Based Syst. , vol.16 , pp. 261-268
    • Misevicius, A.1
  • 48
    • 14844344220 scopus 로고    scopus 로고
    • A tabu search algorithm for the quadratic assignment problem
    • A. Miseviî¡ius A tabu search algorithm for the quadratic assignment problem Comput. Optim. Appl. 30 1 2005 95 111
    • (2005) Comput. Optim. Appl. , vol.30 , Issue.1 , pp. 95-111
    • Miseviîius, A.1
  • 51
    • 33749569898 scopus 로고    scopus 로고
    • Assignment problems a golden anniversary survey
    • D.W. Pentico Assignment problems a golden anniversary survey Eur. J. Oper. Res. 176 4 2007 774 793
    • (2007) Eur. J. Oper. Res. , vol.176 , Issue.4 , pp. 774-793
    • Pentico, D.W.1
  • 53
    • 0033159967 scopus 로고    scopus 로고
    • New complexity measures for the facility layout problem an empirical study using traditional and neural network analysis
    • 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 Comput. Ind. Eng. 36 3 1999 585 602
    • (1999) Comput. Ind. Eng. , vol.36 , Issue.3 , pp. 585-602
    • Rossin, D.F.1    Springer, M.C.2    Klein, B.D.3
  • 54
    • 0028515971 scopus 로고
    • Extensions of a tabu search adaptation to the quadratic assignment problem
    • J. Skorin-Kapov Extensions of a tabu search adaptation to the quadratic assignment problem Comput. Oper. Res. 21 8 1994 855 865
    • (1994) Comput. Oper. Res. , vol.21 , Issue.8 , pp. 855-865
    • Skorin-Kapov, J.1
  • 55
    • 0002370536 scopus 로고
    • The backboard wiring problem a placement algorithm
    • L. Steinberg The backboard wiring problem a placement algorithm SIAM Rev. 3 1 1961 37 50
    • (1961) SIAM Rev. , vol.3 , Issue.1 , pp. 37-50
    • Steinberg, L.1
  • 56
    • 0002529867 scopus 로고    scopus 로고
    • ACO algorithms for the quadratic assignment problem
    • D. Corne, M. Dorigo, F. Glover, McGraw-Hill Maidenhead, UK, England
    • T. Stutzle, and M. Dorigo ACO algorithms for the quadratic assignment problem D. Corne, M. Dorigo, F. Glover, New Ideas for Optimization 1999 McGraw-Hill Maidenhead, UK, England 33 50
    • (1999) New Ideas for Optimization , pp. 33-50
    • Stutzle, T.1    Dorigo, M.2
  • 57
    • 0026189990 scopus 로고
    • Robust taboo search for the quadratic assignment problem
    • E. Taillard Robust taboo search for the quadratic assignment problem Parallel Comput. 17 4-5 1991 443 455
    • (1991) Parallel Comput. , vol.17 , Issue.45 , pp. 443-455
    • Taillard, E.1
  • 58
    • 0002370079 scopus 로고
    • Comparison of iterative searches for the quadratic assignment problem
    • E.D. Taillard Comparison of iterative searches for the quadratic assignment problem Locat. Sci. 3 2 1995 87 105
    • (1995) Locat. Sci. , vol.3 , Issue.2 , pp. 87-105
    • Taillard, E.D.1
  • 59
    • 33645275170 scopus 로고    scopus 로고
    • COSEARCH a parallel cooperative metaheuristic
    • E-G. Talbi, and V. Bachelet COSEARCH a parallel cooperative metaheuristic J. Math. Model. Algorithms 5 1 2006 5 22
    • (2006) J. Math. Model. Algorithms , vol.5 , Issue.1 , pp. 5-22
    • Talbi, E.-G.1    Bachelet, V.2
  • 61
    • 0028368302 scopus 로고
    • A genetic approach to the quadratic assignment problem
    • D.M. Tate, and A.E. Smith A genetic approach to the quadratic assignment problem Comput. Oper. Res. 22 1 1995 73 83
    • (1995) Comput. Oper. Res. , vol.22 , Issue.1 , pp. 73-83
    • Tate, D.M.1    Smith, A.E.2
  • 62
    • 84880573220 scopus 로고    scopus 로고
    • A new robust island parallel genetic algorithm for the quadratic assignment problem
    • U. Tosun, T. Dokeroglu, and A. Cosar A new robust island parallel genetic algorithm for the quadratic assignment problem Int. J. Prod. Res. 51 14 2013 4117 4133
    • (2013) Int. J. Prod. Res. , vol.51 , Issue.14 , pp. 4117-4133
    • Tosun, U.1    Dokeroglu, T.2    Cosar, A.3
  • 63
    • 84907195236 scopus 로고    scopus 로고
    • Distributed Database Design using Evolutionary Algorithms
    • U. Tosun Distributed Database Design using Evolutionary Algorithms J. Comm. Net. 16 4 2014 430 435
    • (2014) J. Comm. Net. , vol.16 , Issue.4 , pp. 430-435
    • Tosun, U.1
  • 64
    • 33646692921 scopus 로고    scopus 로고
    • A hybrid metaheuristic for the quadratic assignment problem
    • L. Tseng, and S. Liang A hybrid metaheuristic for the quadratic assignment problem Comput. Optim. Appl. 34 1 2005 85 113
    • (2005) Comput. Optim. Appl. , vol.34 , Issue.1 , pp. 85-113
    • Tseng, L.1    Liang, S.2
  • 65
    • 85132898589 scopus 로고    scopus 로고
    • Solving Quadratic Assignment Problems by Genetic Algorithms with GPU Computation: A Case Study
    • Canada
    • Tsutsui, S.; Fujimoto, N.; 2009. Solving Quadratic Assignment Problems by Genetic Algorithms with GPU Computation: a Case Study. GECCO Montreal Quebec, Canada.
    • (2009) GECCO Montreal Quebec
    • Tsutsui, S.1    Fujimoto, N.2
  • 66
    • 0023315023 scopus 로고
    • Solving quadratic assignment problems by simulated annealing
    • M.R. Wilhelm Solving quadratic assignment problems by simulated annealing IIE Trans. 19 1 1987 107 119
    • (1987) IIE Trans. , vol.19 , Issue.1 , pp. 107-119
    • Wilhelm, M.R.1
  • 67
    • 84855900713 scopus 로고    scopus 로고
    • Global optimality conditions and optimization methods for quadratic assignment problems
    • Zhiyou Wu, Yongjian Yang, Fusheng Bai, and Jing Tian Global optimality conditions and optimization methods for quadratic assignment problems Appl. Math. Comput. 218 11 2012 6214 6231
    • (2012) Appl. Math. Comput. , vol.218 , Issue.11 , pp. 6214-6231
    • Wu, Z.1    Yang, Y.2    Bai, F.3    Tian, J.4
  • 68
    • 74549219414 scopus 로고    scopus 로고
    • SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
    • W. Zhu, J. Curry, and A. Marquez SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration Int. J. Prod. Res. 48 4 2010 1035 1047
    • (2010) Int. J. Prod. Res. , vol.48 , Issue.4 , pp. 1035-1047
    • Zhu, W.1    Curry, J.2    Marquez, A.3


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