메뉴 건너뛰기




Volumn 7, Issue 1, 2001, Pages 5-21

Study of permutation operators for minimum span frequency assignment using an order based representation

Author keywords

[No Author keywords available]

Indexed keywords

CORRELATION THEORY; FREQUENCY ALLOCATION; GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; SIGNAL INTERFERENCE;

EID: 0035121030     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026597127504     Document Type: Article
Times cited : (18)

References (21)
  • 2
  • 6
    • 0343499514 scopus 로고
    • Order-Based Genetic Algorithms and the Graph Coloring Problem
    • Van Nostrand Reinhold, New York
    • Davis, L. (1991). "Order-Based Genetic Algorithms and the Graph Coloring Problem." Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, pp. 72-90.
    • (1991) Handbook of Genetic Algorithms , pp. 72-90
    • Davis, L.1
  • 8
    • 0022665248 scopus 로고
    • Some Lower Bounds for a Class of Frequency Assignment Problems
    • Gamst, A. (1986). "Some Lower Bounds for a Class of Frequency Assignment Problems." IEEE Transactions on Vehicular Technology 35, 8-14.
    • (1986) IEEE Transactions on Vehicular Technology , vol.35 , pp. 8-14
    • Gamst, A.1
  • 11
    • 0031233009 scopus 로고    scopus 로고
    • FASoft: A System for Discrete Channel Frequency Assignment
    • Hurley, S., D. Smith, and S. Thiel. (1997). "FASoft: A System for Discrete Channel Frequency Assignment." Radio Science 32, 1921-1939.
    • (1997) Radio Science , vol.32 , pp. 1921-1939
    • Hurley, S.1    Smith, D.2    Thiel, S.3
  • 12
    • 0031270671 scopus 로고    scopus 로고
    • A Unified Approach to the Assignment of Radio Channels on a Hexagonal Grid
    • Leese, R.A. (1997). "A Unified Approach to the Assignment of Radio Channels on a Hexagonal Grid." IEEE Transactions on Vehicular Technology 46(4), 968-980.
    • (1997) IEEE Transactions on Vehicular Technology , vol.46 , Issue.4 , pp. 968-980
    • Leese, R.A.1
  • 13
    • 0003378748 scopus 로고    scopus 로고
    • Edge Assembly Crossover: A High-Power Genetic Algorithm for the Traveling Salesman Problem
    • Morgan Kaufmann, Michigan State University
    • Nagata, Y. and Shigenobu, K. (1997). "Edge Assembly Crossover: A High-Power Genetic Algorithm for the Traveling Salesman Problem." Proceedings of the 7th International Conference on Genetic Algorithms. Morgan Kaufmann, Michigan State University, pp. 450-457.
    • (1997) Proceedings of the 7th International Conference on Genetic Algorithms , pp. 450-457
    • Nagata, Y.1    Shigenobu, K.2
  • 15
    • 0032070963 scopus 로고    scopus 로고
    • Improving Heuristics for the Frequency Assignment Problem
    • ISSN 0377-2217
    • Smith, D., S. Hurley, and S. Thiel. (1998). "Improving Heuristics for the Frequency Assignment Problem." European Journal of Operational Research 107(1), 76-86. ISSN 0377-2217.
    • (1998) European Journal of Operational Research , vol.107 , Issue.1 , pp. 76-86
    • Smith, D.1    Hurley, S.2    Thiel, S.3
  • 20
    • 0001868119 scopus 로고
    • Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator
    • San Mateo, CA. In J.D. Schaffer (ed.), Morgan Kaufmann
    • Whitley, D. (1989). "Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator." Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA. In J.D. Schaffer (ed.), Morgan Kaufmann, pp. 133-140.
    • (1989) Proceedings of the Third International Conference on Genetic Algorithms , pp. 133-140
    • Whitley, D.1
  • 21
    • 0003602231 scopus 로고    scopus 로고
    • Part C: Evolutionary Computation Models, Section C3.3. Institute of Physics Publishing
    • Whitley, D. (1997) Handbook of Evolutionary Computation, Part C: Evolutionary Computation Models, Section C3.3. Institute of Physics Publishing.
    • (1997) Handbook of Evolutionary Computation
    • Whitley, D.1


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