메뉴 건너뛰기




Volumn 209, Issue 3, 2011, Pages 215-218

An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems

(1)  Paul, G a  


Author keywords

Combinatorial optimization; Computing science; Heuristics; Tabu search

Indexed keywords

COMPUTING SCIENCE; EFFICIENT IMPLEMENTATION; HEURISTICS; PRIORITY QUEUES; QUADRATIC ASSIGNMENT PROBLEMS; TABU SEARCH HEURISTIC;

EID: 78649629199     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.09.009     Document Type: Article
Times cited : (18)

References (31)
  • 1
    • 2942696007 scopus 로고    scopus 로고
    • Recent advances in the solution of quadratic assignment problems
    • K. Anstreicher Recent advances in the solution of quadratic assignment problems Mathematical Programming 97 2003 27 42
    • (2003) Mathematical Programming , vol.97 , pp. 27-42
    • Anstreicher, K.1
  • 2
    • 0021481361 scopus 로고
    • A thermodynamically motivated simulation procedure for combinatorial optimization problems
    • R.E.F. Burkhard, and Rendl A thermodynamically motivated simulation procedure for combinatorial optimization problems European Journal of Operational Research 17 1984 169 174
    • (1984) European Journal of Operational Research , vol.17 , pp. 169-174
    • Burkhard, R.E.F.1    Rendl2
  • 6
    • 3843125656 scopus 로고    scopus 로고
    • Heuristic algorithms for the solution of the quadratic assignment problem
    • Z. Drezner Heuristic algorithms for the solution of the quadratic assignment problem Journal of Applied Mathematics and Decision Sciences 6 2002 163 173
    • (2002) Journal of Applied Mathematics and Decision Sciences , vol.6 , pp. 163-173
    • Drezner, Z.1
  • 7
    • 3242711972 scopus 로고    scopus 로고
    • A new genetic algorithm for the quadratic assignment problem
    • DOI 10.1287/ijoc.15.3.320.16076
    • Z. Drezner A new genetic algorithm for the quadratic assignment problem INFORMS Journal of Computing 15 2003 320 330 (Pubitemid 39042724)
    • (2003) INFORMS Journal on Computing , vol.15 , Issue.3 , pp. 320-330
    • Drezner, Z.1
  • 8
    • 4344642070 scopus 로고    scopus 로고
    • The extended concentric tabu for the quadratic assignment problem
    • Z. Drezner The extended concentric tabu for the quadratic assignment problem European Journal of Operational Research 160 2005 416 422
    • (2005) European Journal of Operational Research , vol.160 , pp. 416-422
    • Drezner, Z.1
  • 9
    • 19944393263 scopus 로고    scopus 로고
    • Compounded genetic algorithms
    • Z. Drezner Compounded genetic algorithms Operations Research Letters 33 2005 475 480
    • (2005) Operations Research Letters , vol.33 , pp. 475-480
    • Drezner, Z.1
  • 10
    • 27744462230 scopus 로고    scopus 로고
    • A distance based rule for removing population members in genetic algorithms
    • Z. Drezner A distance based rule for removing population members in genetic algorithms 4OR 3 2005 109 116
    • (2005) 4OR , vol.3 , pp. 109-116
    • Drezner, Z.1
  • 11
    • 34548434653 scopus 로고    scopus 로고
    • Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
    • Z. Drezner Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem Computers and Operations Research 35 2008 717 736
    • (2008) Computers and Operations Research , vol.35 , pp. 717-736
    • Drezner, Z.1
  • 12
    • 25444476941 scopus 로고    scopus 로고
    • Recent Advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
    • Z. Drezner, P.M. Hahn, and.D. Taillard Recent Advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods Annals of Operations Research 139 2005 65 94
    • (2005) Annals of Operations Research , vol.139 , pp. 65-94
    • Drezner, Z.1    Hahn, P.M.2    Taillard ., D.3
  • 14
    • 80053513434 scopus 로고    scopus 로고
    • On the range of tabu tenure in solving quadratic assignment problems recent advances in computing and management information systems
    • Petratos, P., Marcoulides, G.A., (Eds.)
    • Drezner, Z., Marcoulides, G., 2009. On the range of tabu tenure in solving quadratic assignment problems recent advances in computing and management information systems. In: Petratos, P., Marcoulides, G.A., (Eds.), ATINER, Recent Advances in Computing and Management Information Systems, pp. 157-169.
    • (2009) ATINER, Recent Advances in Computing and Management Information Systems , pp. 157-169
    • Drezner, Z.1    Marcoulides, G.2
  • 15
    • 0001079364 scopus 로고    scopus 로고
    • Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems
    • M. Hasegawa, T. Ikeguchi, and K. Aihara Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems Control and Cybernetics 29 2000 773 788
    • (2000) Control and Cybernetics , vol.29 , pp. 773-788
    • Hasegawa, M.1    Ikeguchi, T.2    Aihara, K.3
  • 17
    • 56349104182 scopus 로고    scopus 로고
    • A cooperative parallel tabu search algorithm for the quadratic assignment problem
    • T. James, C. Rego, and F. Glover A cooperative parallel tabu search algorithm for the quadratic assignment problem European Journal of Operational Research 195 2009 810 826
    • (2009) European Journal of Operational Research , vol.195 , pp. 810-826
    • James, T.1    Rego, C.2    Glover, F.3
  • 18
    • 0002384937 scopus 로고
    • Assignment problems and the location of economic activities
    • T. Koopmans, and M. Beckmann Assignment problems and the location of economic activities Econometrica 25 1957 53 76
    • (1957) Econometrica , vol.25 , pp. 53-76
    • Koopmans, T.1    Beckmann, M.2
  • 20
    • 0029517641 scopus 로고
    • An empirical assessment of priority queues in event-driven molecular dynamics simulation
    • M. Marn, and P. Cordero An empirical assessment of priority queues in event-driven molecular dynamics simulation Computer Physics Communications 92 1995 214 224
    • (1995) Computer Physics Communications , vol.92 , pp. 214-224
    • Marn, M.1    Cordero, P.2
  • 22
    • 0029275320 scopus 로고
    • A Lagrangian-relaxation algorithm for sparse quadratic assignment problems
    • I.Z. Milis, and V.F. Magirou A Lagrangian-relaxation algorithm for sparse quadratic assignment problems Operations Research Letters 17 1995 69 76
    • (1995) Operations Research Letters , vol.17 , pp. 69-76
    • Milis, I.Z.1    Magirou, V.F.2
  • 23
    • 14844344220 scopus 로고    scopus 로고
    • A tabu search algorithm for the quadratic assignment problem
    • A. Misevicius A tabu search algorithm for the quadratic assignment problem Computational Optimization and Applications 30 2007 95 111
    • (2007) Computational Optimization and Applications , vol.30 , pp. 95-111
    • Misevicius, A.1
  • 24
  • 25
    • 0002017054 scopus 로고
    • The quadratic assignment problem: A survey and recent developments
    • Quadratic Assignment and Related Problems
    • P.M. Pardalos, F. Rendl, and H. Wolkowicz The quadratic assignment problem: a survey and recent developments P.M. Pardalos, H. Wolkowicz, Quadratic Assignment and Related Problems DIMACS Series on Discrete Mathematics and Theoretical Computer Science 16 1994 American Mathematical Society Baltimore, MD 1 42
    • (1994) DIMACS Series on Discrete Mathematics and Theoretical Computer Science , vol.16 , pp. 1-42
    • Pardalos, P.M.1    Rendl, F.2    Wolkowicz, H.3
  • 26
    • 0031152332 scopus 로고    scopus 로고
    • Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
    • P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende Algorithm 769: fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP ACM Transactions on Mathematical Software (TOMS) 23 1997 196 208
    • (1997) ACM Transactions on Mathematical Software (TOMS) , vol.23 , pp. 196-208
    • Pardalos, P.M.1    Pitsoulis, L.S.2    Resende, M.G.C.3
  • 27
    • 33846366012 scopus 로고    scopus 로고
    • A Complexity O(1) priority queue for event driven molecular dynamics simulations
    • G. Paul A Complexity O(1) priority queue for event driven molecular dynamics simulations Journal of Computational Physics 221 2007 615 625
    • (2007) Journal of Computational Physics , vol.221 , pp. 615-625
    • Paul, G.1
  • 28
    • 0000718681 scopus 로고
    • Measuring cache and TLB performance and their effects on benchmark run times
    • R.H. Saavedra, and A.J. Smith Measuring cache and TLB performance and their effects on benchmark run times IEEE Transactions on Computers 44 1995 1223 1235
    • (1995) IEEE Transactions on Computers , vol.44 , pp. 1223-1235
    • Saavedra, R.H.1    Smith, A.J.2
  • 29
    • 0028515971 scopus 로고
    • Extensions of a tabu search adaptation to the quadratic assignment problem
    • J. Skorinkapov Extensions of a tabu search adaptation to the quadratic assignment problem Computers and Operations Research 121 1994 855 865
    • (1994) Computers and Operations Research , vol.121 , pp. 855-865
    • Skorinkapov, J.1


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