메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages

Mapping the convergence of genetic algorithms

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33749502482     PISSN: 11739126     EISSN: 15327612     Source Type: Journal    
DOI: 10.1155/JAMDS/2006/70240     Document Type: Article
Times cited : (4)

References (38)
  • 1
    • 0034079265 scopus 로고    scopus 로고
    • A greedy genetic algorithm for the quadratic assignment problem
    • R. K. Ahuja J. B. Orlin A. Tiwari A greedy genetic algorithm for the quadratic assignment problem Computers & Operations Research 27 2000 10 917-934
    • (2000) Computers & Operations Research , vol.27 , Issue.10 , pp. 917-934
    • Ahuja, R.K.1    Orlin, J.B.2    Tiwari, A.3
  • 2
    • 0000990727 scopus 로고    scopus 로고
    • A new bound for the quadratic assignment problem based on convex quadratic programming
    • K. M. Anstreicher N. W. Brixius A new bound for the quadratic assignment problem based on convex quadratic programming Mathematical Programming 89 2001 3 341-357
    • (2001) Mathematical Programming , vol.89 , Issue.3 , pp. 341-357
    • Anstreicher, K.M.1    Brixius, N.W.2
  • 4
    • 0000970291 scopus 로고
    • A heuristic algorithm and simulation approach to relative location of facilities
    • G. C. Armour E. S. Buffa A heuristic algorithm and simulation approach to relative location of facilities Management Science 9 1963 294-309
    • (1963) Management Science , vol.9 , pp. 294-309
    • Armour, G.C.1    Buffa, E.S.2
  • 6
    • 0344666795 scopus 로고    scopus 로고
    • Population heuristics
    • Oxford University Press Oxford
    • J. E. Beasley P. M. Pardalos M. G. C. Resende Population heuristics Handbook of Applied Optimization Oxford University Press Oxford 2002 138-157
    • (2002) Handbook of Applied Optimization , pp. 138-157
    • Beasley, J.E.1
  • 7
    • 0006511273 scopus 로고
    • Locations with spatial interactions: The quadratic assignment problem
    • Wiley New York Wiley-Intersci. Ser. Discrete Math. Optim
    • R. E. Burkard P. B. Mirchandani R. L. Francis Locations with spatial interactions: The quadratic assignment problem Discrete Location Theory Wiley-Intersci. Ser. Discrete Math. Optim. 387-437 Wiley New York 1990
    • (1990) Discrete Location Theory , pp. 387-437
    • Burkard, R.E.1
  • 8
    • 0021481361 scopus 로고
    • A thermodynamically motivated simulation procedure for combinatorial optimization problems
    • R. E. Burkard F. Rendl A thermodynamically motivated simulation procedure for combinatorial optimization problems European Journal of Operational Research 17 1984 2 169-174
    • (1984) European Journal of Operational Research , vol.17 , Issue.2 , pp. 169-174
    • Burkard, R.E.1    Rendl, F.2
  • 9
    • 0003833098 scopus 로고    scopus 로고
    • The Quadratic Assignment Problem: Theory and Algorithms
    • Kluwer Academic Dordrecht
    • E. Çela The Quadratic Assignment Problem: Theory and Algorithms Combinatorial Optimization 1 Kluwer Academic Dordrecht 1998 xvi+287
    • (1998) Combinatorial Optimization , vol.1
    • Çela, E.1
  • 11
    • 0019086564 scopus 로고
    • DISCON: A new method for the layout problem
    • Z. Drezner DISCON: A new method for the layout problem Operations Research 28 1980 1375-1384
    • (1980) Operations Research , vol.28 , pp. 1375-1384
    • Drezner, Z.1
  • 12
    • 0023386457 scopus 로고
    • A heuristic procedure for the layout of a large number of facilities
    • Z. Drezner A heuristic procedure for the layout of a large number of facilities Management Science 33 1987 909-915
    • (1987) Management Science , vol.33 , pp. 909-915
    • Drezner, Z.1
  • 13
    • 0347064619 scopus 로고
    • Lower bounds based on linear programming for the quadratic assignment problem
    • Z. Drezner Lower bounds based on linear programming for the quadratic assignment problem Computational Optimization & Applications 4 1995 2 159-165
    • (1995) Computational Optimization & Applications , vol.4 , Issue.2 , pp. 159-165
    • Drezner, Z.1
  • 14
    • 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 3 163-173
    • (2002) Journal of Applied Mathematics and Decision Sciences , vol.6 , Issue.3 , pp. 163-173
    • Drezner, Z.1
  • 15
    • 3242711972 scopus 로고    scopus 로고
    • A new genetic algorithm for the quadratic assignment problem
    • Z. Drezner A new genetic algorithm for the quadratic assignment problem INFORMS Journal on Computing 15 2003 3 320-330
    • (2003) INFORMS Journal on Computing , vol.15 , Issue.3 , pp. 320-330
    • Drezner, Z.1
  • 16
    • 19944393263 scopus 로고    scopus 로고
    • Compounded genetic algorithms for the quadratic assignment problem
    • Z. Drezner Compounded genetic algorithms for the quadratic assignment problem Operations Research Letters 33 2005 5 475-480
    • (2005) Operations Research Letters , vol.33 , Issue.5 , pp. 475-480
    • Drezner, Z.1
  • 17
    • 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 2 416-422
    • (2005) European Journal of Operational Research , vol.160 , Issue.2 , pp. 416-422
    • Drezner, Z.1
  • 18
    • 0001815620 scopus 로고
    • Genetic hybrids for the quadratic assignment problem
    • Quadratic Assignment and Related Problems (New Brunswick, NJ, 1993)
    • C. Fleurent J. Ferland Genetic hybrids for the quadratic assignment problem Quadratic Assignment and Related Problems (New Brunswick, NJ, 1993) DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16 173-187 American Mathematical Society Rhode Island 1994
    • (1994) DIMACS Series in Discrete Mathematics and Theoretical Computer Science , vol.16 , pp. 173-187
    • Fleurent, C.1    Ferland, J.2
  • 21
    • 0032201668 scopus 로고    scopus 로고
    • Lower bounds for the quadratic assignment problem based upon a dual formulation
    • P. M. Hahn T. L. Grant Lower bounds for the quadratic assignment problem based upon a dual formulation Operations Research 46 1998 6 912-922
    • (1998) Operations Research , vol.46 , Issue.6 , pp. 912-922
    • Hahn, P.M.1    Grant, T.L.2
  • 24
    • 0000282077 scopus 로고
    • The quadratic assignment problem
    • E. L. Lawler The quadratic assignment problem Management Science 9 1963 586-599
    • (1963) Management Science , vol.9 , pp. 586-599
    • Lawler, E.L.1
  • 25
    • 0001111194 scopus 로고
    • A greedy randomized adaptive search procedure for the quadratic assignment problem
    • Quadratic Assignment and Related Problems American Mathematical Society Rhode Island
    • Y. Li P. M. Pardalos M. G. C. Resende P. M. Pardalos H. Wolkowicz A greedy randomized adaptive search procedure for the quadratic assignment problem Quadratic Assignment and Related Problems DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16 American Mathematical Society Rhode Island 1994 237-261
    • (1994) DIMACS Series in Discrete Mathematics and Theoretical Computer Science , vol.16 , pp. 237-261
    • Li, Y.1    Pardalos, P.M.2    Resende, M.G.C.3
  • 26
    • 84973795167 scopus 로고
    • A procedure for transforming points in multi-dimensional space to two-dimensional
    • G. A. Marcoulides Z. Drezner A procedure for transforming points in multi-dimensional space to two-dimensional Educational and Psychological Measurement 53 1993 933-940
    • (1993) Educational and Psychological Measurement , vol.53 , pp. 933-940
    • Marcoulides, G.A.1    Drezner, Z.2
  • 27
    • 33745659696 scopus 로고    scopus 로고
    • A procedure for detecting pattern clustering in measurement designs
    • M. Wilson K. Draney G. Engelhard Jr. Ablex New Jersey
    • G. A. Marcoulides Z. Drezner M. Wilson K. Draney G. Engelhard Jr. A procedure for detecting pattern clustering in measurement designs Objective Measurement: Theory into Practice 5 Ablex New Jersey 2000 287-302
    • (2000) Objective Measurement: Theory Into Practice , vol.5 , pp. 287-302
    • Marcoulides, G.A.1    Drezner, Z.2
  • 28
    • 0038569043 scopus 로고    scopus 로고
    • Memetic algorithms
    • Oxford University Press Oxford
    • P. Moscato P. M. Pardalos M. G. C. Resende Memetic algorithms Handbook of Applied Optimization Oxford University Press Oxford 2002
    • (2002) Handbook of Applied Optimization
    • Moscato, P.1
  • 29
    • 0000965291 scopus 로고
    • An experimental comparison of techniques for the assignment of facilities to locations
    • C. E. Nugent T. E. Vollman J. Ruml An experimental comparison of techniques for the assignment of facilities to locations Operations Research 16 1968 150-173
    • (1968) Operations Research , vol.16 , pp. 150-173
    • Nugent, C.E.1    Vollman, T.E.2    Ruml, J.3
  • 30
    • 33749476602 scopus 로고    scopus 로고
    • Solving certain large instances of the quadratic assignment problem: Steinberg's examples
    • Working paper California Institute of Technology California
    • M. Nystrom Solving certain large instances of the quadratic assignment problem: Steinberg's examples Working paper California Institute of Technology California 1999
    • (1999)
    • Nystrom, M.1
  • 31
    • 4344629426 scopus 로고    scopus 로고
    • The quadratic assignment problem
    • Z. Drezner H. Hamacher Springer Berlin
    • F. Rendl Z. Drezner H. Hamacher The quadratic assignment problem Facility Location: Applications and Theory 439-457 Springer Berlin 2002
    • (2002) Facility Location: Applications and Theory , pp. 439-457
    • Rendl, F.1
  • 32
    • 0000138587 scopus 로고
    • Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming
    • M. G. C. Resende K. G. Ramakrishnan Z. Drezner Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming Operations Research 43 1995 5 781-791
    • (1995) Operations Research , vol.43 , Issue.5 , pp. 781-791
    • Resende, M.G.C.1    Ramakrishnan, K.G.2    Drezner, Z.3
  • 33
    • 0001987222 scopus 로고    scopus 로고
    • Heuristic search methods
    • G. A. Marcoulides Lawrence Erlbaum Associates New Jersey
    • S. Salhi G. A. Marcoulides Heuristic search methods Modern Methods for Business Research Lawrence Erlbaum Associates New Jersey 1998
    • (1998) Modern Methods for Business Research
    • Salhi, S.1
  • 34
    • 0001997908 scopus 로고
    • Tabu search applied to the quadratic assignment problem
    • J. Skorin-Kapov Tabu search applied to the quadratic assignment problem ORSA Journal on Computing 2 1990 1 33-45
    • (1990) ORSA Journal on Computing , vol.2 , Issue.1 , pp. 33-45
    • Skorin-Kapov, J.1
  • 35
    • 0026189990 scopus 로고
    • Robust taboo search for the quadratic assignment problem
    • E. D. Taillard Robust taboo search for the quadratic assignment problem Parallel Computing 17 1991 4-5 443-455
    • (1991) Parallel Computing , vol.17 , Issue.4-5 , pp. 443-455
    • Taillard, E.D.1
  • 36
    • 0002370079 scopus 로고
    • Comparison of iterative searches for the quadratic assignment problem
    • E. D. Taillard Comparison of iterative searches for the quadratic assignment problem Location Science 3 1995 2 87-105
    • (1995) Location Science , vol.3 , Issue.2 , pp. 87-105
    • Taillard, E.D.1
  • 37
    • 0028368302 scopus 로고
    • A genetic approach to the quadratic assignment problem
    • D. M. Tate A. E. Smith A genetic approach to the quadratic assignment problem Computers & Operations Research 22 1995 1 73-83
    • (1995) Computers & Operations Research , vol.22 , Issue.1 , pp. 73-83
    • Tate, D.M.1    Smith, A.E.2
  • 38
    • 0023315023 scopus 로고
    • Solving quadratic assignment problems by simulated annealing
    • M. R. Wilhelm T. L. Ward Solving quadratic assignment problems by simulated annealing IIE Transactions 19 1987 107-119
    • (1987) IIE Transactions , vol.19 , pp. 107-119
    • Wilhelm, M.R.1    Ward, T.L.2


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