메뉴 건너뛰기




Volumn 15, Issue 5, 2011, Pages 975-990

Optimization algorithms for large-scale real-world instances of the frequency assignment problem

Author keywords

Frequency assignment problem; Large scale real world instances; Metaheuristics; Optimal design

Indexed keywords

FREQUENCY ASSIGNMENT PROBLEM; FREQUENCY ASSIGNMENTS; FREQUENCY PLAN; GLOBAL SEARCH CAPABILITY; GSM NETWORKS; HIGH-QUALITY SOLUTIONS; KEY ISSUES; LARGE NETWORKS; LARGE-SCALE REAL-WORLD INSTANCES; MATHEMATICAL FORMALISM; META HEURISTICS; MOBILE COMMUNICATIONS; MOBILE NETWORKS; OPTIMAL DESIGN; OPTIMAL PLAN; OPTIMIZATION ALGORITHMS; POPULATION-BASED ALGORITHM; REAL-WORLD; SCATTER SEARCH; SEARCH METHOD; STRONG GROWTH; TRAJECTORY-BASED;

EID: 79954715035     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-010-0653-4     Document Type: Article
Times cited : (34)

References (62)
  • 3
    • 0036505146 scopus 로고    scopus 로고
    • New hybrid genetic algorithms for the frequency assignment problem
    • Alabau M, Idoumghar L, Schott R (2002) New hybrid genetic algorithms for the frequency assignment problem. IEEE Trans Broad 48(1): 27-34.
    • (2002) IEEE Trans Broadcasting , vol.48 , Issue.1 , pp. 27-34
    • Alabau, M.1    Idoumghar, L.2    Schott, R.3
  • 5
    • 3242657867 scopus 로고    scopus 로고
    • Minimizing the span of d-walks to compute optimum frequency assignments
    • Avenali A, Mannino C, Sassano A (2002) Minimizing the span of d-walks to compute optimum frequency assignments. Math Prog (A) 91: 357-374.
    • (2002) Math Program (A) , vol.91 , pp. 357-374
    • Avenali, A.1    Mannino, C.2    Sassano, A.3
  • 6
    • 0003984832 scopus 로고
    • Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning
    • Carnegie Mellon University, Pittsburgh, PA, USA
    • Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA, USA.
    • (1994) Technical Report CMU-CS-94-163
    • Baluja, S.1
  • 7
    • 4043100992 scopus 로고    scopus 로고
    • Optimized planning of frequency hopping in cellular networks
    • Bjorklund P, Varbrand P, Yuan D (2005) Optimized planning of frequency hopping in cellular networks. Comput Oper Res 32(1): 169-186.
    • (2005) Comput Oper Res , vol.32 , Issue.1 , pp. 169-186
    • Bjorklund, P.1    Varbrand, P.2    Yuan, D.3
  • 8
    • 0344236266 scopus 로고    scopus 로고
    • Metaheuristics in combinatorial optimization: overview and conceptual comparison
    • Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3): 268-308.
    • (2003) ACM Comput Surv , vol.35 , Issue.3 , pp. 268-308
    • Blum, C.1    Roli, A.2
  • 9
    • 1842483279 scopus 로고    scopus 로고
    • The hyper-cube framework for ant colony optimization
    • Blum C, Dorigo M (2004) The hyper-cube framework for ant colony optimization. IEEE Trans Syst Man Cybern Part B 34(2): 1161-1172.
    • (2004) IEEE Trans Syst Man Cybern Part B , vol.34 , Issue.2 , pp. 1161-1172
    • Blum, C.1    Dorigo, M.2
  • 12
    • 34250223479 scopus 로고    scopus 로고
    • A genetic algorithm for frequency assignment with problem decomposition
    • Colombo G (2006) A genetic algorithm for frequency assignment with problem decomposition. Int J Mobile Netw Des Innov 1(2): 102-112.
    • (2006) Int J Mobile Netw Des Innov , vol.1 , Issue.2 , pp. 102-112
    • Colombo, G.1
  • 13
    • 29644438050 scopus 로고    scopus 로고
    • Statistical comparison of classifiers over multiple data sets
    • Demšar J (2006) Statistical comparison of classifiers over multiple data sets. J Mach Learn Res 7: 1-30.
    • (2006) J Mach Learn Res , vol.7 , pp. 1-30
    • Demšar, J.1
  • 17
    • 0000049494 scopus 로고
    • Greedy randomized adaptive search procedures
    • Feo T, Resende M (1995) Greedy randomized adaptive search procedures. J Glob Optim 6: 109-133.
    • (1995) J Glob Optim , vol.6 , pp. 109-133
    • Feo, T.1    Resende, M.2
  • 18
    • 0033880603 scopus 로고    scopus 로고
    • Frequency assignment in mobile radio systems using branch-and-cut techniques
    • Fischetti M, Lepsch C, Minerva G, Romanin-Jacur G, Toto E (2000) Frequency assignment in mobile radio systems using branch-and-cut techniques. Eur J Oper Res 123(2): 241-255.
    • (2000) Eur J Oper Res , vol.123 , Issue.2 , pp. 241-255
    • Fischetti, M.1    Lepsch, C.2    Minerva, G.3    Romanin-Jacur, G.4    Toto, E.5
  • 24
    • 4544369650 scopus 로고    scopus 로고
    • Application of markov decision processes to the frequency assignment problem
    • Greff JY, Idoumghar L, Schott R (2004) Application of markov decision processes to the frequency assignment problem. Appl Artif Intell 18(8): 761-773.
    • (2004) Appl Artif Intell , vol.18 , Issue.8 , pp. 761-773
    • Greff, J.Y.1    Idoumghar, L.2    Schott, R.3
  • 25
    • 0019213982 scopus 로고
    • Frequency assignment: theory and applications
    • Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68(12): 1497-1514.
    • (1980) Proc IEEE , vol.68 , Issue.12 , pp. 1497-1514
    • Hale, W.K.1
  • 26
    • 84959045917 scopus 로고    scopus 로고
    • Scatter search for graph coloring
    • LNCS 2310
    • Hamiez HP, Hao JK (2002) Scatter search for graph coloring. In: Artificial evolution. LNCS 2310, pp 195-213.
    • (2002) Artificial evolution , pp. 195-213
    • Hamiez, H.P.1    Hao, J.K.2
  • 29
    • 0037952116 scopus 로고    scopus 로고
    • Mathematical models and exact methods for channel assignment in cellular networks
    • Kluwer
    • Jaumard B, Marcotte O, Meyer C (1999) Mathematical models and exact methods for channel assignment in cellular networks. In: Telecommunications network planning. Kluwer, pp 239-256.
    • (1999) Telecommunications network planning , pp. 239-256
    • Jaumard, B.1    Marcotte, O.2    Meyer, C.3
  • 30
    • 0036343626 scopus 로고    scopus 로고
    • On GSM mobile measurement based interference matrix generation
    • VTC Spring 2002
    • Kuurne AMJ (2002) On GSM mobile measurement based interference matrix generation. In: IEEE 55th vehicular technology conference, VTC Spring 2002, pp 1965-1969.
    • (2002) IEEE 55th vehicular technology conference , pp. 1965-1969
    • Kuurne, A.M.J.1
  • 31
    • 33749655175 scopus 로고    scopus 로고
    • A memetic algorithm for channel assignment in wireless FDMA systems
    • Kim SS, Smith AE, Lee JH (2007) A memetic algorithm for channel assignment in wireless FDMA systems. Comput Oper Res 34: 1842-1856.
    • (2007) Comput Oper Res , vol.34 , pp. 1842-1856
    • Kim, S.S.1    Smith, A.E.2    Lee, J.H.3
  • 33
    • 0035479210 scopus 로고    scopus 로고
    • Guided genetic algorithm and its application to radio link frequency assignment problems
    • Lau TL, Tsang EPK (2001) Guided genetic algorithm and its application to radio link frequency assignment problems. Constraints 6(4): 373-398.
    • (2001) Constraints , vol.6 , Issue.4 , pp. 373-398
    • Lau, T.L.1    Tsang, E.P.K.2
  • 36
    • 79954823012 scopus 로고    scopus 로고
    • Parallel heterogeneous metaheuristics
    • In Alba E (ed), Wiley
    • Luna F, Alba E, Nebro AJ (2005) Parallel heterogeneous metaheuristics. In Alba E (ed) Parallel metaheuristics. Wiley, pp 395-422.
    • (2005) Parallel metaheuristics , pp. 395-422
    • Luna, F.1    Alba, E.2    Nebro, A.J.3
  • 41
    • 84867970586 scopus 로고    scopus 로고
    • An enumerative algorithm for the frequency assignment problem
    • Mannino C, Sassano A (2003) An enumerative algorithm for the frequency assignment problem. Discret Appl Math 129: 155-169.
    • (2003) Discret Appl Math , vol.129 , pp. 155-169
    • Mannino, C.1    Sassano, A.2
  • 42
    • 33750973640 scopus 로고    scopus 로고
    • The stable set problem and the thinness of a graph
    • Mannino C, Oriolo G, Ricci F, Chandran S (2007) The stable set problem and the thinness of a graph. Oper Res Lett 35(1): 1-9.
    • (2007) Oper Res Lett , vol.35 , Issue.1 , pp. 1-9
    • Mannino, C.1    Oriolo, G.2    Ricci, F.3    Chandran, S.4
  • 44
    • 25444485816 scopus 로고    scopus 로고
    • Principles of scatter search
    • Martí R, Laguna M, Glover F (2006) Principles of scatter search. Eur J Oper Res 169(2): 359-372.
    • (2006) Eur J Oper Res , vol.169 , Issue.2 , pp. 359-372
    • Martí, R.1    Laguna, M.2    Glover, F.3
  • 45
  • 46
    • 17144395918 scopus 로고    scopus 로고
    • Application of the parameter-free genetic algorithm to the fixed channel assignment problem
    • Matsui S, Watanabe I, Tokoro KI (2005) Application of the parameter-free genetic algorithm to the fixed channel assignment problem. Syst Comput Jpn 36(4): 71-81.
    • (2005) Syst Comput Jpn , vol.36 , Issue.4 , pp. 71-81
    • Matsui, S.1    Watanabe, I.2    Tokoro, K.I.3
  • 51
    • 33750076966 scopus 로고    scopus 로고
    • A unified view on hybrid metaheuristics
    • LNCS 4030
    • Raidl G (2006) A unified view on hybrid metaheuristics. In: Hybrid metaheuristics (HM 2006). LNCS 4030, pp 1-12.
    • (2006) Hybrid metaheuristics (HM 2006) , pp. 1-12
    • Raidl, G.1
  • 52
    • 0029244868 scopus 로고
    • UMTS: targets, system concept, and standardization in a global framework
    • Rapeli J (1995) UMTS: targets, system concept, and standardization in a global framework. IEEE Pers Commun 2(1): 30-37.
    • (1995) IEEE Pers Commun , vol.2 , Issue.1 , pp. 30-37
    • Rapeli, J.1
  • 54
    • 13544273259 scopus 로고    scopus 로고
    • A portable and scalable algorithm for a class of constrained combinatorial optimization problems
    • Salcedo-Sanz S, Bousoño-Calzón C (2005) A portable and scalable algorithm for a class of constrained combinatorial optimization problems. Comput Oper Res 32: 2671-2687.
    • (2005) Comput Oper Res , vol.32 , pp. 2671-2687
    • Salcedo-Sanz, S.1    Bousoño-Calzón, C.2
  • 57
    • 0036723306 scopus 로고    scopus 로고
    • A taxonomy of hybrid metaheuristics
    • Talbi E (2002) A taxonomy of hybrid metaheuristics. J Heuristics 8(5): 541-564.
    • (2002) J Heuristics , vol.8 , Issue.5 , pp. 541-564
    • Talbi, E.1
  • 58
    • 23044521217 scopus 로고    scopus 로고
    • Local search algorithms for the radio link frequency assignment problem
    • Tiourine SR, Hurkens CAJ, Lenstra JK (2000) Local search algorithms for the radio link frequency assignment problem. Telecommun Syst 13(2-4): 293-314.
    • (2000) Telecommun Syst , vol.13 , Issue.2-4 , pp. 293-314
    • Tiourine, S.R.1    Hurkens, C.A.J.2    Lenstra, J.K.3
  • 59
    • 0035121030 scopus 로고    scopus 로고
    • A study of permutation operators for minimum span frequency assignment using an order based representation
    • Valenzuela C (2001) A study of permutation operators for minimum span frequency assignment using an order based representation. J Heuristics 7: 5-21.
    • (2001) J Heuristics , vol.7 , pp. 5-21
    • Valenzuela, C.1
  • 60
    • 0033102347 scopus 로고    scopus 로고
    • Guided local search
    • Voudouris C, Tsang E (1999) Guided local search. Eur J Oper Res 113(2): 449-499.
    • (1999) Eur J Oper Res , vol.113 , Issue.2 , pp. 449-499
    • Voudouris, C.1    Tsang, E.2
  • 62
    • 23044526543 scopus 로고    scopus 로고
    • A co-evolutionist meta-heuristic for the assignment of the frequencies in cellular networks
    • LNCS 2037
    • Weinberg B, Bachelet V, Talbi EG (2001) A co-evolutionist meta-heuristic for the assignment of the frequencies in cellular networks. In: EvoWorkshop 2001. LNCS 2037, pp 140-149.
    • (2001) EvoWorkshop 2001 , pp. 140-149
    • Weinberg, B.1    Bachelet, V.2    Talbi, E.G.3


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