메뉴 건너뛰기




Volumn 16, Issue 8, 2000, Pages 927-935

ANTS heuristic for the frequency assignment problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INTERFERENCE SUPPRESSION; MOBILE RADIO SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; RADIO LINKS; RADIO STATIONS; RADIO TRANSMITTERS;

EID: 0033738508     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(00)00046-7     Document Type: Article
Times cited : (122)

References (30)
  • 1
    • 0141876444 scopus 로고
    • A branch-and-cut algorithm for the frequency assignment problem
    • CALMA Project, T.U. Eindhoven and T.U. Delft, The Netherlands
    • K.I. Aardal, A. Hipolito, S. van Hoesel, B. Jansen, A branch-and-cut algorithm for the frequency assignment problem, Technical Report Annex T-2.2.1 A, CALMA Project, T.U. Eindhoven and T.U. Delft, The Netherlands, 1995.
    • (1995) Technical Report Annex T-2.2.1 A
    • Aardal, K.I.1    Hipolito, A.2    Van Hoesel, S.3    Jansen, B.4
  • 2
    • 0342571522 scopus 로고    scopus 로고
    • Greedy and tabu search heuristics for channel block assignment in cellular systems
    • GERAD, Montreal, Canada
    • P.M. Adjakplé, B. Jaumard, Greedy and tabu search heuristics for channel block assignment in cellular systems, Technical Report G-97-45, GERAD, Montreal, Canada, 1997.
    • (1997) Technical Report G-97-45
    • Adjakplé, P.M.1    Jaumard, B.2
  • 3
    • 85031558022 scopus 로고    scopus 로고
    • A new class of lower bounds on the quality of channel assignment using column generation techniques
    • GERAD, Montreal, Canada
    • P. Adjakplé, B. Jaumard, A new class of lower bounds on the quality of channel assignment using column generation techniques, Technical Report, GERAD, Montreal, Canada, 1998.
    • (1998) Technical Report
    • Adjakplé, P.1    Jaumard, B.2
  • 4
    • 0015681213 scopus 로고
    • A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system
    • L.G. Anderson, A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system, IEEE Trans. Commun. 21 (1973) 1294-1301.
    • (1973) IEEE Trans. Commun. , vol.21 , pp. 1294-1301
    • Anderson, L.G.1
  • 6
    • 25544461293 scopus 로고    scopus 로고
    • The orientation model for frequency assignment problems
    • Konrad-Zuse-Zentrum für Informationstechnik, Berlin, Germany
    • R. Borndörfer, A. Eisenblätter, M. Grötschel, A. Martin, The orientation model for frequency assignment problems, Technical Report TR 98-01, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, Germany, 1998.
    • (1998) Technical Report TR 98-01
    • Borndörfer, R.1    Eisenblätter, A.2    Grötschel, M.3    Martin, A.4
  • 7
    • 0012489173 scopus 로고
    • Resolution du probleme de l'affectation des frequences par programmation par contraintes
    • CNET Belfort, France
    • A. Caminada, Resolution du probleme de l'affectation des frequences par programmation par contraintes, Technical Report FT.CNET/BEL/POH/CDI/71-95/CA, CNET Belfort, France, 1995.
    • (1995) Technical Report FT.CNET/BEL/POH/CDI/71-95/CA
    • Caminada, A.1
  • 11
    • 0002012598 scopus 로고    scopus 로고
    • The ant colony optimization meta-heuristic
    • D. Corne, M. Dorigo, F. Glover (Eds.), McGraw-Hill, London
    • M. Dorigo, G. Di Caro, The ant colony optimization meta-heuristic, in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, London, 1999, pp. 11-32.
    • (1999) New Ideas in Optimization , pp. 11-32
    • Dorigo, M.1    Di Caro, G.2
  • 12
  • 14
    • 0026943333 scopus 로고
    • A neural network parallel algorithm for channel assignment problems in cellular radio network
    • N. Funabiki, Y. Takefuji, A neural network parallel algorithm for channel assignment problems in cellular radio network, IEEE Trans. Vehicular Technol. 41 (1992) 430-437.
    • (1992) IEEE Trans. Vehicular Technol. , vol.41 , pp. 430-437
    • Funabiki, N.1    Takefuji, Y.2
  • 15
    • 0022665248 scopus 로고
    • Some lower bounds for a class of frequency assignment problems
    • A. Gamst, Some lower bounds for a class of frequency assignment problems, IEEE Trans. Vehicular Technol. 35 (1986) 8-14.
    • (1986) IEEE Trans. Vehicular Technol. , vol.35 , pp. 8-14
    • Gamst, A.1
  • 16
  • 17
    • 0019213982 scopus 로고
    • Frequency assignment: Theory and applications
    • W.K. Hale, Frequency assignment: theory and applications, Proceedings of the IEEE, Vol. 68, 1980, pp. 1497-1514.
    • (1980) Proceedings of the IEEE , vol.68 , pp. 1497-1514
    • Hale, W.K.1
  • 18
    • 0013133994 scopus 로고
    • Upper and lower bounding techniques for frequency assignment problems
    • Department of Mathematics and Computing Science, Eindhoven University of Technology, The Netherlands
    • C.A.J. Hurkens, S.R. Tiourine, Upper and lower bounding techniques for frequency assignment problems, Technical Report 95-34, Department of Mathematics and Computing Science, Eindhoven University of Technology, The Netherlands, 1995.
    • (1995) Technical Report 95-34
    • Hurkens, C.A.J.1    Tiourine, S.R.2
  • 19
    • 0031233009 scopus 로고    scopus 로고
    • FASoft: A system for discrete channel frequency assignment
    • S. Hurley, D.H. Smith, S.U. Thiel, FASoft: a system for discrete channel frequency assignment, Radio Sci. 32 (5) (1997) 1921-1939.
    • (1997) Radio Sci. , vol.32 , Issue.5 , pp. 1921-1939
    • Hurley, S.1    Smith, D.H.2    Thiel, S.U.3
  • 20
    • 85031575854 scopus 로고    scopus 로고
    • The partial constraint satisfaction problem: Facets and lifting theorems
    • University of Maastricht, The Netherlands
    • A. Koster, S. van Hoesel, A. Kolen, The partial constraint satisfaction problem: facets and lifting theorems, Technical Report RM 97/005, University of Maastricht, The Netherlands, 1997.
    • (1997) Technical Report RM 97/005
    • Koster, A.1    Van Hoesel, S.2    Kolen, A.3
  • 21
    • 0000127689 scopus 로고    scopus 로고
    • Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
    • V Maniezzo, Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem, INFORMS J. Comput. 11 (1999) 358-369.
    • (1999) INFORMS J. Comput. , vol.11 , pp. 358-369
    • Maniezzo, V.1
  • 23
    • 85031564182 scopus 로고    scopus 로고
    • An enumerative algorithm for the frequency assignment problem
    • submitted
    • C. Mannino, A. Sassano, An enumerative algorithm for the frequency assignment problem, Discrete Appl. Math., submitted.
    • Discrete Appl. Math.
    • Mannino, C.1    Sassano, A.2
  • 24
    • 0000789601 scopus 로고    scopus 로고
    • Bounds for the frequency assignment problem
    • D.H. Smith, S. Hurley, Bounds for the frequency assignment problem, Discrete Math. 167/168 (1997) 571-582.
    • (1997) Discrete Math. , vol.167-168 , pp. 571-582
    • Smith, D.H.1    Hurley, S.2
  • 25
    • 0032070963 scopus 로고    scopus 로고
    • Improving heuristics for the frequency assignment problem
    • D.H. Smith, S. Hurley, S.U. Thiel, Improving heuristics for the frequency assignment problem, European J. Oper. Res. 107 (1998) 76-86.
    • (1998) European J. Oper. Res. , vol.107 , pp. 76-86
    • Smith, D.H.1    Hurley, S.2    Thiel, S.U.3
  • 26
    • 0031079526 scopus 로고    scopus 로고
    • A new lower bound for the frequency assignment problem
    • D.W. Tcha, Y.J. Chung, T.J. Choi, A new lower bound for the frequency assignment problem, IEEE Trans. Networking 5 (1) (1997) 34-39.
    • (1997) IEEE Trans. Networking , vol.5 , Issue.1 , pp. 34-39
    • Tcha, D.W.1    Chung, Y.J.2    Choi, T.J.3
  • 27
    • 0003848562 scopus 로고
    • An overview of algorithmic approaches to frequency assignment problems
    • The Netherlands
    • S. Tiourine, C. Hurkens, J.K. Lenstra, An overview of algorithmic approaches to frequency assignment problems, Technical Report T.U. Eindhoven, The Netherlands, 1995.
    • (1995) Technical Report T.U. Eindhoven
    • Tiourine, S.1    Hurkens, C.2    Lenstra, J.K.3
  • 29
    • 0000455645 scopus 로고    scopus 로고
    • Potential reduction approach to the frequency assignment problem
    • J.P. Warners, T. Terlaky, C. Roos, B.A. Jansen, Potential reduction approach to the frequency assignment problem, Discrete Appl. Math. 78 (1997) 251-282.
    • (1997) Discrete Appl. Math. , vol.78 , pp. 251-282
    • Warners, J.P.1    Terlaky, T.2    Roos, C.3    Jansen, B.A.4


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