메뉴 건너뛰기




Volumn 13, Issue 5, 2009, Pages 1133-1150

Benchmarking a wide spectrum of metaheuristic techniques for the radio network design problem

Author keywords

Antennae; Benchmarking; Evolutionary algorithms; Metaheuristics; Optimization; Radio network design (RND)

Indexed keywords

ANTENNAE; DIRECT IMPACT; INDUSTRIAL AREA; META-HEURISTIC TECHNIQUES; METAHEURISTICS; NP-HARD; OPTIMIZATION PROBLEMS; PROBLEM FORMULATION; RADIO NETWORK DESIGN; RADIO NETWORK DESIGN (RND); WIDE SPECTRUM;

EID: 70349858275     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2009.2023448     Document Type: Article
Times cited : (32)

References (117)
  • 7
    • 70349877915 scopus 로고    scopus 로고
    • E. Alba, Evolutionary algorithms for optimal placement of antennae in radio network design, presented at NIDISC, Santa Fe, NM, 2004.
    • E. Alba, "Evolutionary algorithms for optimal placement of antennae in radio network design," presented at NIDISC, Santa Fe, NM, 2004.
  • 9
    • 0034923421 scopus 로고    scopus 로고
    • P. Calegari, F. Guidec, and P. Kuonen, Combinatorial optimization algorithms for radio network planning, J. Theoret. Comput. Sci., 263, no. 1-2, pp. 235-265, 2001.
    • P. Calegari, F. Guidec, and P. Kuonen, "Combinatorial optimization algorithms for radio network planning," J. Theoret. Comput. Sci., vol. 263, no. 1-2, pp. 235-265, 2001.
  • 10
    • 0002828212 scopus 로고    scopus 로고
    • P. Calegari, F. Guidec, P. Kuonen, and D. Kobler, Parallel island-based genetic algorithm for radio network design, J. Parallel Distrib. Comput., 47, no. 1, pp. 86-90, 1997.
    • P. Calegari, F. Guidec, P. Kuonen, and D. Kobler, "Parallel island-based genetic algorithm for radio network design," J. Parallel Distrib. Comput., vol. 47, no. 1, pp. 86-90, 1997.
  • 11
    • 33746253849 scopus 로고    scopus 로고
    • On the behavior of parallel genetic algorithms for optimal placement of antennae in telecommunications
    • E. Alba and F. Chicano, "On the behavior of parallel genetic algorithms for optimal placement of antennae in telecommunications," Int. J. Found. Comput. Sci., vol. 16, pp. 86-90, 2005.
    • (2005) Int. J. Found. Comput. Sci , vol.16 , pp. 86-90
    • Alba, E.1    Chicano, F.2
  • 12
    • 0029511501 scopus 로고
    • Genetic algorithms for telecommunication network optimization
    • presented at, Man and Cybernetics
    • G. Celli, E. Costamagna, and A. Fanni, "Genetic algorithms for telecommunication network optimization," presented at IEEE Int. Conf. Syst., Man and Cybernetics, 1995.
    • (1995) IEEE Int. Conf. Syst
    • Celli, G.1    Costamagna, E.2    Fanni, A.3
  • 13
    • 0033666262 scopus 로고    scopus 로고
    • H. Meunier, E. G. Talbi, and P. Reininger, A multiobjective genetic algorithm for radio network optimization, presented at Congr. Evol. Comput., 2000.
    • H. Meunier, E. G. Talbi, and P. Reininger, "A multiobjective genetic algorithm for radio network optimization," presented at Congr. Evol. Comput., 2000.
  • 15
    • 0001953837 scopus 로고
    • Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization
    • C. M. Fonseca and P. J. Fleming, "Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization," in Proc. 5th Int. Conf. Genetic Algorithms, 1993, pp. 416-423.
    • (1993) Proc. 5th Int. Conf. Genetic Algorithms , pp. 416-423
    • Fonseca, C.M.1    Fleming, P.J.2
  • 16
    • 33846636744 scopus 로고    scopus 로고
    • Designing cellular networks using a parallel hybrid metaheuristic on the computational grid
    • E. G. Talbi, S. Cahon, and N. Melab, "Designing cellular networks using a parallel hybrid metaheuristic on the computational grid," Comput. Commun., vol. 30, no. 4, pp. 698-713, 2007.
    • (2007) Comput. Commun , vol.30 , Issue.4 , pp. 698-713
    • Talbi, E.G.1    Cahon, S.2    Melab, N.3
  • 17
    • 0034923421 scopus 로고    scopus 로고
    • P. Calégari, F. Guidec, P. Kuonen, B. Chamaret, S. Ubéda, S. Josselin, D. Wagner, and M. Pizarosso, Radio network planning with combinatorial optimization algorithms, Theoret. Comput. Sci., 263, no. 1-2, pp. 235-265, 2001.
    • P. Calégari, F. Guidec, P. Kuonen, B. Chamaret, S. Ubéda, S. Josselin, D. Wagner, and M. Pizarosso, "Radio network planning with combinatorial optimization algorithms," Theoret. Comput. Sci., vol. 263, no. 1-2, pp. 235-265, 2001.
  • 20
    • 0027678534 scopus 로고
    • Lipschitzian optimization without the lipschitz constant
    • D. R. Jones, C. D. Perttunen, and B. E. Stuckman, "Lipschitzian optimization without the lipschitz constant.," J. Optim. Theory Applicat., vol. 79, no. 1, pp. 157-181, 1993.
    • (1993) J. Optim. Theory Applicat , vol.79 , Issue.1 , pp. 157-181
    • Jones, D.R.1    Perttunen, C.D.2    Stuckman, B.E.3
  • 21
    • 0035448085 scopus 로고    scopus 로고
    • A heuristic approach for antenna positioning in cellular networks
    • M. Vasquez and J.-K. Hao, "A heuristic approach for antenna positioning in cellular networks," J. Heuristics, vol. 7, no. 5, pp. 443-472, 2001.
    • (2001) J. Heuristics , vol.7 , Issue.5 , pp. 443-472
    • Vasquez, M.1    Hao, J.-K.2
  • 24
    • 0345427032 scopus 로고
    • The maximal covering location problem
    • R. L. Church and C. ReVelle, "The maximal covering location problem," Reg. Sci., vol. 30, pp. 101-118, 1974.
    • (1974) Reg. Sci , vol.30 , pp. 101-118
    • Church, R.L.1    ReVelle, C.2
  • 26
    • 33646900663 scopus 로고
    • An integrated approach to cellular mobile communication planning using traffic data prestructured by a self-organizing feature map
    • presented at
    • T. Fritsch and S. Hanshans, "An integrated approach to cellular mobile communication planning using traffic data prestructured by a self-organizing feature map," presented at IEEE Int. Conf. Neural Netw., 1993.
    • (1993) IEEE Int. Conf. Neural Netw
    • Fritsch, T.1    Hanshans, S.2
  • 27
    • 70349881018 scopus 로고    scopus 로고
    • M. Kamenetsky and M. Unbehaun, Coverage planning for outdoor wireless LAN systems, presented at Int. Access, Transmission, Networking Broadband Commun., Zurich, Switzerland, 2002.
    • M. Kamenetsky and M. Unbehaun, "Coverage planning for outdoor wireless LAN systems," presented at Int. Access, Transmission, Networking Broadband Commun., Zurich, Switzerland, 2002.
  • 28
    • 20144370042 scopus 로고    scopus 로고
    • On the wireless local area network design problem with performance guarantees
    • A. Bahri and S. Chamberland, "On the wireless local area network design problem with performance guarantees," Int. J. Comput. Telecommun. Netw.: Comput. Netw., vol. 48, no. 6, pp. 856-866, 2005.
    • (2005) Int. J. Comput. Telecommun. Netw.: Comput. Netw , vol.48 , Issue.6 , pp. 856-866
    • Bahri, A.1    Chamberland, S.2
  • 30
    • 0030087079 scopus 로고    scopus 로고
    • Planning cordless business communication systems
    • Feb
    • T. Fruhwirth, P. Brisset, and J.-R. Molwitz, "Planning cordless business communication systems," IEEE Intell. Syst., vol. 11, no. 1, pp. 50-55, Feb. 1996.
    • (1996) IEEE Intell. Syst , vol.11 , Issue.1 , pp. 50-55
    • Fruhwirth, T.1    Brisset, P.2    Molwitz, J.-R.3
  • 31
    • 0036555844 scopus 로고    scopus 로고
    • Deux algorithmes pour le deploiement de radioports das les reseeaux cellulaires
    • B. Abolhassani, J. E. Salt, and D. Dodds, "Deux algorithmes pour le deploiement de radioports das les reseeaux cellulaires," Can. J. Elect. Comput. Eng., vol. 27, no. 2, pp. 51-54, 2002.
    • (2002) Can. J. Elect. Comput. Eng , vol.27 , Issue.2 , pp. 51-54
    • Abolhassani, B.1    Salt, J.E.2    Dodds, D.3
  • 32
    • 0036821355 scopus 로고    scopus 로고
    • Methods for optimizing the location of base stations for indoor wireless communications
    • Oct
    • J. Zhong, T. K. Sarkar, and L. Bin-Hong, "Methods for optimizing the location of base stations for indoor wireless communications," IEEE Trans. Antennas Propagation, vol. 50, no. 10, pp. 1481-1483, Oct. 2002.
    • (2002) IEEE Trans. Antennas Propagation , vol.50 , Issue.10 , pp. 1481-1483
    • Zhong, J.1    Sarkar, T.K.2    Bin-Hong, L.3
  • 33
    • 0037003172 scopus 로고    scopus 로고
    • C. Prommak, J. Kabara, D. Tipper, and C. Charnsripinyo, Next generation wireless LAN system design, presented at MILCOM, 2002.
    • C. Prommak, J. Kabara, D. Tipper, and C. Charnsripinyo, "Next generation wireless LAN system design," presented at MILCOM, 2002.
  • 34
    • 0030151209 scopus 로고    scopus 로고
    • Optimal location of transmitters for micro-cellular radio communication system design
    • May
    • H. D. Sherali, C. M. Pendyala, and T. S. Rappaport, "Optimal location of transmitters for micro-cellular radio communication system design," IEEE J. Sel. Areas Commun., vol. 14, no. 4, pp. 662-673, May 1996.
    • (1996) IEEE J. Sel. Areas Commun , vol.14 , Issue.4 , pp. 662-673
    • Sherali, H.D.1    Pendyala, C.M.2    Rappaport, T.S.3
  • 36
    • 0036722531 scopus 로고    scopus 로고
    • Optimization of indoor wireless communication network layouts
    • M. Adickes, R. Billo, B. Norman, S. Banerjee, B. Nnaji, and J. Rajgopal, "Optimization of indoor wireless communication network layouts," IIE Trans., vol. 34, no. 9, pp. 823-836, 2002.
    • (2002) IIE Trans , vol.34 , Issue.9 , pp. 823-836
    • Adickes, M.1    Billo, R.2    Norman, B.3    Banerjee, S.4    Nnaji, B.5    Rajgopal, J.6
  • 38
    • 0003298952 scopus 로고
    • Network planning for third-generation mobile radio systems
    • Nov
    • J. C. S. Cheung, M. A. Beach, and J. P. McGeehan, "Network planning for third-generation mobile radio systems," IEEE Commun. Mag., vol. 32, no. 12, pp. 54-59, Nov. 1994.
    • (1994) IEEE Commun. Mag , vol.32 , Issue.12 , pp. 54-59
    • Cheung, J.C.S.1    Beach, M.A.2    McGeehan, J.P.3
  • 39
    • 30644466024 scopus 로고    scopus 로고
    • Hierarchical parallel approach for GSM mobile network design
    • E.-G. Talbi and H. Meunier, "Hierarchical parallel approach for GSM mobile network design," J. Parallel Distrib. Comput. vol. 66, no. 2, pp. 274-290, 2006.
    • (2006) J. Parallel Distrib. Comput , vol.66 , Issue.2 , pp. 274-290
    • Talbi, E.-G.1    Meunier, H.2
  • 40
    • 70349862288 scopus 로고    scopus 로고
    • (2007, Nov.). Mentum Planet [Online]. Available: http://www.mentum.com//?_kk=mentum&_kt=f53ff1c3-ccc7-44d9-8481- 5b56a06446e9&gclid=CPL0rPX45o8CFQuIlAodMR06ZQ
    • (2007, Nov.). Mentum Planet [Online]. Available: http://www.mentum.com//?_kk=mentum&_kt=f53ff1c3-ccc7-44d9-8481- 5b56a06446e9&gclid=CPL0rPX45o8CFQuIlAodMR06ZQ
  • 41
    • 70349862293 scopus 로고    scopus 로고
    • (2007, Nov.). FRTelecom [Online].Available: http://www.francetelecom.com/en/group/rd/
    • (2007, Nov.). FRTelecom [Online].Available: http://www.francetelecom.com/en/group/rd/
  • 42
    • 70349867727 scopus 로고    scopus 로고
    • P. Calegari, F. Guidec, P. Kuonen, and D. A. W. D. Wagner, Genetic approach to radio network optimization for mobile systems genetic approach to radio network optimization for mobile systems, presented at IEEE 47th, Veh. Technol. Conf., 1997.
    • P. Calegari, F. Guidec, P. Kuonen, and D. A. W. D. Wagner, "Genetic approach to radio network optimization for mobile systems genetic approach to radio network optimization for mobile systems," presented at IEEE 47th, Veh. Technol. Conf., 1997.
  • 43
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Sci, vol. 220, no. 4598, pp. 671-680, 1983.
    • (1983) Sci , vol.220 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 44
    • 28044443373 scopus 로고    scopus 로고
    • Automatic radio planning of GSM cellular networks
    • I. Kostanic and N. Faour, "Automatic radio planning of GSM cellular networks," Nonlinear Anal., vol. 63, no. 5-7, pp. e847-e858, 2005.
    • (2005) Nonlinear Anal , vol.63 , Issue.5-7
    • Kostanic, I.1    Faour, N.2
  • 45
    • 0027543819 scopus 로고
    • Channel assignment for cellular radio using simulated annealing
    • Feb
    • M. Duque-Antón, D. Kunz, and B. Rüber, "Channel assignment for cellular radio using simulated annealing," IEEE Trans. Veh. Technol. vol. 42, no. 1, pp. 14-21, Feb. 1993.
    • (1993) IEEE Trans. Veh. Technol , vol.42 , Issue.1 , pp. 14-21
    • Duque-Antón, M.1    Kunz, D.2    Rüber, B.3
  • 46
    • 0031619229 scopus 로고    scopus 로고
    • Solution for the constrained guillotine cutting problem by simulated annealing
    • V. Parada, M. Sepulveda, M. Solar, and A. Gómes, "Solution for the constrained guillotine cutting problem by simulated annealing," Comput. Operations Res., vol. 25, no. 1, pp. 37-47, 1998.
    • (1998) Comput. Operations Res , vol.25 , Issue.1 , pp. 37-47
    • Parada, V.1    Sepulveda, M.2    Solar, M.3    Gómes, A.4
  • 47
    • 33646116064 scopus 로고    scopus 로고
    • GenAnneal: Genetically modified simulated annealing
    • I. G. Tsoulos and I. E. Lagaris, "GenAnneal: Genetically modified simulated annealing," Comput. Phys. Commun., vol. 174, no. 10, pp. 846-851, 2006.
    • (2006) Comput. Phys. Commun , vol.174 , Issue.10 , pp. 846-851
    • Tsoulos, I.G.1    Lagaris, I.E.2
  • 48
    • 34247513733 scopus 로고    scopus 로고
    • Quantum annealing and related optimization methods
    • Heidelberg, Germany: Springer-Verlag
    • A. Das and B. K. Chakrabarti, "Quantum annealing and related optimization methods," in Lecture Note in Physics, vol. 679, Heidelberg, Germany: Springer-Verlag, 2005.
    • (2005) Lecture Note in Physics , vol.679
    • Das, A.1    Chakrabarti, B.K.2
  • 49
    • 70349879959 scopus 로고    scopus 로고
    • L. J. Eshelman, The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination, presented at Found. Genetic Algorithms, San Francisco, CA, 1991.
    • L. J. Eshelman, "The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination," presented at Found. Genetic Algorithms, San Francisco, CA, 1991.
  • 51
    • 4244191287 scopus 로고    scopus 로고
    • Local search algorithms for combinatorial problems analysis, improvements, and new applications
    • Amsterdam, The Netherlands: IOS
    • T. Stützle, "Local search algorithms for combinatorial problems analysis, improvements, and new applications," in Dissertations in Artificial Intelligence-Infix, vol. 220, Amsterdam, The Netherlands: IOS, 1999, pp. 203-203.
    • (1999) Dissertations in Artificial Intelligence-Infix , vol.220 , pp. 203-203
    • Stützle, T.1
  • 52
    • 70349877907 scopus 로고    scopus 로고
    • Chiarandini and T. Stützle, An application of iterated local search to graph coloring, presented at Comput. Symp. Graph Coloring Generalizations, 2002.
    • Chiarandini and T. Stützle, "An application of iterated local search to graph coloring," presented at Comput. Symp. Graph Coloring Generalizations, 2002.
  • 54
    • 33747014280 scopus 로고    scopus 로고
    • Iterated local search for the quadratic assignment problem
    • T. Stützle, "Iterated local search for the quadratic assignment problem," Eur. J. Oper. Res., vol. 173, pp. 1519-1539, 2006.
    • (2006) Eur. J. Oper. Res , vol.173 , pp. 1519-1539
    • Stützle, T.1
  • 55
    • 70349857195 scopus 로고    scopus 로고
    • Applying iterated local search to reduce the costs of backhaul in telecommunications network design
    • presented at
    • J. Bater, K. Brown, L. Doyle, T. Forde, and F. Mullany, "Applying iterated local search to reduce the costs of backhaul in telecommunications network design," presented at Inform. Technol. Telecommun. Conf., 2005.
    • (2005) Inform. Technol. Telecommun. Conf
    • Bater, J.1    Brown, K.2    Doyle, L.3    Forde, T.4    Mullany, F.5
  • 56
    • 70349864379 scopus 로고    scopus 로고
    • An iterated local search heuristic for the logistics network design problem with single assignment,
    • J. F. Cordeau, G. Laporte, and F. Pasin, "An iterated local search heuristic for the logistics network design problem with single assignment,: Int. J. Product. Econ., 2005.
    • (2005) Int. J. Product. Econ
    • Cordeau, J.F.1    Laporte, G.2    Pasin, F.3
  • 57
    • 24644466093 scopus 로고    scopus 로고
    • D. Reichelt, P. Gmilkowsky, and S. Linser, A study of an iterated local search on the reliable communication networks design problem, presented at Applicat. Evol. Comput., 2005.
    • D. Reichelt, P. Gmilkowsky, and S. Linser, "A study of an iterated local search on the reliable communication networks design problem," presented at Applicat. Evol. Comput., 2005.
  • 58
    • 70349861309 scopus 로고    scopus 로고
    • Iterated local search and constructive heuristics for error correcting code design
    • C. Blum, "Iterated local search and constructive heuristics for error correcting code design," Int. J. Innovative Comput. Appl., vol. 1, no. 1, pp. 14-22, 2007.
    • (2007) Int. J. Innovative Comput. Appl , vol.1 , Issue.1 , pp. 14-22
    • Blum, C.1
  • 59
    • 70349868592 scopus 로고    scopus 로고
    • An iterated local search with adaptive memory applied to the snake in the box problem,
    • Ph.D. thesis, Georgia Inst. Technol, Atlanta, GA
    • J. Brown, "An iterated local search with adaptive memory applied to the snake in the box problem," Ph.D. thesis, Georgia Inst. Technol., Atlanta, GA, 2001.
    • (2001)
    • Brown, J.1
  • 61
    • 85011779332 scopus 로고
    • Removing the genetics from the standard genetic algorithm
    • presented at, San Mateo, CA
    • S. Baluja and R. Caruana, "Removing the genetics from the standard genetic algorithm," presented at 12th Int. Conf. Mach. Learn., San Mateo, CA, 1995.
    • (1995) 12th Int. Conf. Mach. Learn
    • Baluja, S.1    Caruana, R.2
  • 62
    • 33947662522 scopus 로고    scopus 로고
    • A new implementation of population based incremental learning method for optimizations in electromagnetics
    • Apr
    • S. Y. Yang, S. L. Ho, G. Z. Ni, J. M. Machado, and K. F. Wong, "A new implementation of population based incremental learning method for optimizations in electromagnetics," IEEE Trans. Magn., vol. 43, no. 4, pp. 1601-1604, Apr. 2007.
    • (2007) IEEE Trans. Magn , vol.43 , Issue.4 , pp. 1601-1604
    • Yang, S.Y.1    Ho, S.L.2    Ni, G.Z.3    Machado, J.M.4    Wong, K.F.5
  • 63
    • 40649122987 scopus 로고    scopus 로고
    • Population-based incremental learning for multiobjective optimisation
    • S. Bureerat and K. Sriworamas, "Population-based incremental learning for multiobjective optimisation," Soft Comput. Ind. Applicat., vol. 39, pp. 223-232, 2007.
    • (2007) Soft Comput. Ind. Applicat , vol.39 , pp. 223-232
    • Bureerat, S.1    Sriworamas, K.2
  • 64
    • 70349872750 scopus 로고    scopus 로고
    • Clustering ensembles guided unsupervised feature selection using population based incremental learning algorithm
    • Amsterdam, The Netherlands: Elsevier, to be published
    • Y. Hong, S. Kwong, Y. Chang, and Q. Ren, "Clustering ensembles guided unsupervised feature selection using population based incremental learning algorithm," in Pattern Recognition, Amsterdam, The Netherlands: Elsevier, to be published.
    • Pattern Recognition
    • Hong, Y.1    Kwong, S.2    Chang, Y.3    Ren, Q.4
  • 65
    • 37249007987 scopus 로고    scopus 로고
    • A new approach for training of artificial neural networks using population based incremental learning (PBIL)
    • presented at, Istanbul, Turkey
    • M. S. Jelodar, S. M. Fakhraie, and M. N. Ahmadabadi, "A new approach for training of artificial neural networks using population based incremental learning (PBIL)," presented at Int. Conf. Comput. Intell., Istanbul, Turkey, 2004.
    • (2004) Int. Conf. Comput. Intell
    • Jelodar, M.S.1    Fakhraie, S.M.2    Ahmadabadi, M.N.3
  • 66
    • 38349009324 scopus 로고    scopus 로고
    • Toward a management paradigm with a constrained benchmark for autonomic communications
    • New York: Springer-Verlag
    • F. Chiang and R. Braun, "Toward a management paradigm with a constrained benchmark for autonomic communications," in Lecture Notes Computer in Science, vol. 4456, New York: Springer-Verlag, 2007, pp. 250-258.
    • (2007) Lecture Notes Computer in Science , vol.4456 , pp. 250-258
    • Chiang, F.1    Braun, R.2
  • 68
    • 77956024603 scopus 로고    scopus 로고
    • On the use of population-based incremental learning in the medium access control of broadcast communication systems
    • presented at, United Arab Emirates
    • G. I. Papadimitriou, M. S. Obaidat, and A. S. Pomportsis, "On the use of population-based incremental learning in the medium access control of broadcast communication systems," presented at 10th IEEE Int. Conf. Electron., Circ. Syst., (ICECS), Sharjah, United Arab Emirates, 2003.
    • (2003) 10th IEEE Int. Conf. Electron., Circ. Syst., (ICECS), Sharjah
    • Papadimitriou, G.I.1    Obaidat, M.S.2    Pomportsis, A.S.3
  • 69
    • 78049299163 scopus 로고    scopus 로고
    • Digital communication filter design by stochastic optimization
    • presented at NSW, Australia
    • R. Kendall and R. Braun, "Digital communication filter design by stochastic optimization," presented at Workshop Applicat. Radio Sci., Leura NSW, Australia, 2002.
    • (2002) Workshop Applicat. Radio Sci., Leura
    • Kendall, R.1    Braun, R.2
  • 72
    • 33745768483 scopus 로고    scopus 로고
    • Reference chromosome to overcome user fatigue in IEC
    • Tokyo, Japan: Ohmsha
    • Y. Saez, P. Isasi, J. Segovia, and J. C. Hernandez, "Reference chromosome to overcome user fatigue in IEC," in New Generation Computing, vol. 23, Tokyo, Japan: Ohmsha, 2005, pp. 129-142.
    • (2005) New Generation Computing , vol.23 , pp. 129-142
    • Saez, Y.1    Isasi, P.2    Segovia, J.3    Hernandez, J.C.4
  • 74
    • 55349117489 scopus 로고    scopus 로고
    • A Study of the effects of clustering and local search on radio network design: Evolutionary computation approaches
    • presented at
    • Y. Saez, F. Zazo, and P. Isasi, "A Study of the effects of clustering and local search on radio network design: Evolutionary computation approaches," presented at 8th Int. Conf. Hybrid Intell. Syst., 2008.
    • (2008) 8th Int. Conf. Hybrid Intell. Syst
    • Saez, Y.1    Zazo, F.2    Isasi, P.3
  • 76
    • 0003054892 scopus 로고    scopus 로고
    • Differential evolution-a simple evolution strategy for fast optimisation
    • K. Price and R. Storn, "Differential evolution-a simple evolution strategy for fast optimisation," Dr. Dobb's J, vol. 22, pp. 18-24, 1997.
    • (1997) Dr. Dobb's J , vol.22 , pp. 18-24
    • Price, K.1    Storn, R.2
  • 77
    • 34548075850 scopus 로고    scopus 로고
    • Jul, Online, Available
    • K. Price and R. Storn. (2006, Jul.). Web site of DE [Online]. Available: http://www.ICSI.Berkeley.edu/~storn/code.html
    • (2006) Web site of DE
    • Price, K.1    Storn, R.2
  • 80
    • 0141444712 scopus 로고    scopus 로고
    • The pareto differential evolution algorithm
    • H. A. Abbass and R. Sarker, "The pareto differential evolution algorithm," Int. J. Artificial Intell. Tools, vol. 11, no. 4, pp. 531-552, 2002.
    • (2002) Int. J. Artificial Intell. Tools , vol.11 , Issue.4 , pp. 531-552
    • Abbass, H.A.1    Sarker, R.2
  • 81
    • 70349865585 scopus 로고    scopus 로고
    • R. Storn and K. Price, Differential evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces, Int. Comput. Sci. Inst. (ICSI), Tech. Rep. TR-95-012, 1995.
    • R. Storn and K. Price, "Differential evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces," Int. Comput. Sci. Inst. (ICSI), Tech. Rep. TR-95-012, 1995.
  • 83
    • 85032641816 scopus 로고    scopus 로고
    • An annotated bibliography of GRASP
    • P. Festa and M. G. C. Resende, "An annotated bibliography of GRASP," Int. Trans. Oper. Res., vol. 16, no. 1, pp. 1-24, 2009.
    • (2009) Int. Trans. Oper. Res , vol.16 , Issue.1 , pp. 1-24
    • Festa, P.1    Resende, M.G.C.2
  • 85
    • 0001454247 scopus 로고    scopus 로고
    • A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy
    • S. L. Martins, M. G. C. Resende, C. C. Ribeiro, and P. M. Pardalos, "A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy," J. Global Optim., vol. 17, no. 1, pp. 267-283, 2000.
    • (2000) J. Global Optim , vol.17 , Issue.1 , pp. 267-283
    • Martins, S.L.1    Resende, M.G.C.2    Ribeiro, C.C.3    Pardalos, P.M.4
  • 86
    • 0039045920 scopus 로고    scopus 로고
    • A greedy randomized adaptive search procedure for the feedback vertex set problem
    • P. M. Pardalos, T. Qian, and M. G. C. Resende, "A greedy randomized adaptive search procedure for the feedback vertex set problem," J. Combin. Optim., vol. 2, no. 4, pp. 399-412, 1999.
    • (1999) J. Combin. Optim , vol.2 , Issue.4 , pp. 399-412
    • Pardalos, P.M.1    Qian, T.2    Resende, M.G.C.3
  • 88
    • 0032117289 scopus 로고    scopus 로고
    • Computing approximate solutions of the maximum covering problem using GRASP
    • M. G. C. Resende, "Computing approximate solutions of the maximum covering problem using GRASP," J. Heuristics, vol. 4, no. 2, pp. 161-171, 1998.
    • (1998) J. Heuristics , vol.4 , Issue.2 , pp. 161-171
    • Resende, M.G.C.1
  • 89
    • 70349859191 scopus 로고    scopus 로고
    • A GRASP for graph planarization
    • M. G. C. Resende and C. C. Ribeiro, "A GRASP for graph planarization," J. Heuristics, vol. 4, pp. 171-181, 1998.
    • (1998) J. Heuristics , vol.4 , pp. 171-181
    • Resende, M.G.C.1    Ribeiro, C.C.2
  • 90
    • 0012249826 scopus 로고    scopus 로고
    • A hybrid GRASP with perturbations for the steiner problem in graphs
    • C. C. Ribeiro, E. Uchoa, and R. F. Werneck, "A hybrid GRASP with perturbations for the steiner problem in graphs," INFORMS J. Comput. vol. 14, no. 3, pp. 228-246, 2002.
    • (2002) INFORMS J. Comput , vol.14 , Issue.3 , pp. 228-246
    • Ribeiro, C.C.1    Uchoa, E.2    Werneck, R.F.3
  • 92
    • 0000049494 scopus 로고
    • Greedy randomized adaptive search procedures
    • T. A. Feo and M. G. C. Resende, "Greedy randomized adaptive search procedures," J. Global Optimization, vol. 6, no. 2, pp. 109-133, 1995.
    • (1995) J. Global Optimization , vol.6 , Issue.2 , pp. 109-133
    • Feo, T.A.1    Resende, M.G.C.2
  • 93
    • 0031281221 scopus 로고    scopus 로고
    • Variable neighbourhood search
    • N. Mlandenovic and P. Hansen, "Variable neighbourhood search," Comput. Operations Res., vol. 24, no. 11, pp. 1097-1100, 1997.
    • (1997) Comput. Operations Res , vol.24 , Issue.11 , pp. 1097-1100
    • Mlandenovic, N.1    Hansen, P.2
  • 94
    • 0034818087 scopus 로고    scopus 로고
    • Variable neighbourhood search: Principles and applications
    • P. Hansen and N. Mladenovic, "Variable neighbourhood search: Principles and applications," Eur. J. Oper. Res., vol. 130, no. 3, pp. 449-467, 2001.
    • (2001) Eur. J. Oper. Res , vol.130 , Issue.3 , pp. 449-467
    • Hansen, P.1    Mladenovic, N.2
  • 96
    • 0036604755 scopus 로고    scopus 로고
    • New heuristics for 1-D bin-packing
    • K. Fleszar and K. S. Hindi, "New heuristics for 1-D bin-packing.," Comput. Oper. Res., vol. 29, no. 7, pp. 821-839, 2002.
    • (2002) Comput. Oper. Res , vol.29 , Issue.7 , pp. 821-839
    • Fleszar, K.1    Hindi, K.S.2
  • 97
    • 4944245585 scopus 로고    scopus 로고
    • Variable neighborhood search for the maximum clique
    • P. Hansen, N. Mladenovic, and U. Dragan, "Variable neighborhood search for the maximum clique," Discrete Appl. Math., vol. 145, no. 1, pp. 117-125, 2004.
    • (2004) Discrete Appl. Math , vol.145 , Issue.1 , pp. 117-125
    • Hansen, P.1    Mladenovic, N.2    Dragan, U.3
  • 98
    • 44649162530 scopus 로고    scopus 로고
    • Variable neighbourhood search for the global optimization of constrained NLPs
    • presented at
    • L. Liberti and M. Drazi, "Variable neighbourhood search for the global optimization of constrained NLPs," presented at Global Optimization, 2005.
    • (2005) Global Optimization
    • Liberti, L.1    Drazi, M.2
  • 99
    • 70349865588 scopus 로고    scopus 로고
    • E. K. Burke, P. Cowling, and R. Keuthen, Implementation report: Variable neighbourhood search Univ. Nottingham, Nottingham, U.K., 2000.
    • E. K. Burke, P. Cowling, and R. Keuthen, "Implementation report: Variable neighbourhood search" Univ. Nottingham, Nottingham, U.K., 2000.
  • 100
    • 0042021863 scopus 로고    scopus 로고
    • A variable neighborhood search for graph coloring
    • C. Avanthay, A. Hertz, and N. Zufferey, "A variable neighborhood search for graph coloring," Eur. J. Oper. Res., vol. 151, no. 2, pp. 379-388, 2003.
    • (2003) Eur. J. Oper. Res , vol.151 , Issue.2 , pp. 379-388
    • Avanthay, C.1    Hertz, A.2    Zufferey, N.3
  • 101
    • 0000965650 scopus 로고    scopus 로고
    • Hybrid evolutionary algorithms for graph coloring
    • P. Galinier and J. K. Hao, "Hybrid evolutionary algorithms for graph coloring.," J. Combin. Optim., vol. 3, no. 4, pp. 379-397, 1999.
    • (1999) J. Combin. Optim , vol.3 , Issue.4 , pp. 379-397
    • Galinier, P.1    Hao, J.K.2
  • 102
    • 0346785310 scopus 로고    scopus 로고
    • Variable neighborhood search for extremal graphs: Three ways to automate finding conjectures
    • G. Caporossi and P. Hansen, "Variable neighborhood search for extremal graphs: Three ways to automate finding conjectures," Discrete Math. vol. 276, no. 3, pp. 81-94, 2004.
    • (2004) Discrete Math , vol.276 , Issue.3 , pp. 81-94
    • Caporossi, G.1    Hansen, P.2
  • 103
    • 0041520978 scopus 로고    scopus 로고
    • Variable neighbourhood tabu search and its application to the median cycle problem
    • J. A. M. Pérez, J. M. Moreno-Vega, and I. R. Martín, "Variable neighbourhood tabu search and its application to the median cycle problem," Eur. J. Oper. Res., vol. 151, no. 2, pp. 365-378, 2003.
    • (2003) Eur. J. Oper. Res , vol.151 , Issue.2 , pp. 365-378
    • Pérez, J.A.M.1    Moreno-Vega, J.M.2    Martín, I.R.3
  • 104
    • 1642436954 scopus 로고    scopus 로고
    • Solving the resource-constrained project scheduling problem by a variable neighbourhood search
    • K. Fleszar and K. H. Hindi, "Solving the resource-constrained project scheduling problem by a variable neighbourhood search," Eur. J. Oper. Res, vol. 155, no. 2, pp. 402-413, 2004.
    • (2004) Eur. J. Oper. Res , vol.155 , Issue.2 , pp. 402-413
    • Fleszar, K.1    Hindi, K.H.2
  • 107
    • 43149105386 scopus 로고    scopus 로고
    • A variable neighbourhood search algorithm for the constrained task allocation problem
    • A. Lusa and C. N. Potts, "A variable neighbourhood search algorithm for the constrained task allocation problem," J. Oper. Res. Soc., vol. 59, no. 6, pp. 812-822, 2007.
    • (2007) J. Oper. Res. Soc , vol.59 , Issue.6 , pp. 812-822
    • Lusa, A.1    Potts, C.N.2
  • 108
    • 33748430982 scopus 로고    scopus 로고
    • A variable neighborhood decomposition search method for supply chain management planning problems
    • M. A. Lejeune, "A variable neighborhood decomposition search method for supply chain management planning problems," Eur. J. Oper. Res., vol. 175, no. 2, pp. 959-976, 2006.
    • (2006) Eur. J. Oper. Res , vol.175 , Issue.2 , pp. 959-976
    • Lejeune, M.A.1
  • 109
    • 70349854105 scopus 로고    scopus 로고
    • Online, Available
    • (2008). Boinc [Online]. Available: http://boinc.berkeley.edu
    • Boinc
  • 110
    • 10444272266 scopus 로고    scopus 로고
    • BOINC: A system for public-resource computing and storage
    • presented at, Pittsburgh, PA
    • D. P. Anderson, "BOINC: A system for public-resource computing and storage," presented at 5th IEEE/ACM Int. Workshop Grid Comput., Pittsburgh, PA, 2004.
    • (2004) 5th IEEE/ACM Int. Workshop Grid Comput
    • Anderson, D.P.1
  • 111
    • 14244258507 scopus 로고    scopus 로고
    • Distributed computing in practice: The condor experience
    • D. Thain, T. Tannenbaum, and M. Livny, "Distributed computing in practice: The condor experience," Concurrency Comput. Practice Exp. vol. 17, no. 2-4, pp. 323-356, 2005.
    • (2005) Concurrency Comput. Practice Exp , vol.17 , Issue.2-4 , pp. 323-356
    • Thain, D.1    Tannenbaum, T.2    Livny, M.3
  • 112
    • 34147175605 scopus 로고    scopus 로고
    • High-performance reconfigurable computing
    • D. Buell, T. El-Ghazawi, K. Gaj, and V. Kindratenko, "High-performance reconfigurable computing," Comput., vol. 40, no. 3, pp. 23-27, 2007.
    • (2007) Comput , vol.40 , Issue.3 , pp. 23-27
    • Buell, D.1    El-Ghazawi, T.2    Gaj, K.3    Kindratenko, V.4
  • 113
    • 2642568630 scopus 로고    scopus 로고
    • Guest editors introduction - Special issue on FPGAs: Applications and designs
    • M. A. Vega-Rodríguez, J. M. Sánchez-Pérez, and J. A. Gómez-Pulido, "Guest editors introduction - Special issue on FPGAs: Applications and designs," Microprocess. Microsyst., vol. 28, no. 5-6, pp. 193-196, 2004.
    • (2004) Microprocess. Microsyst , vol.28 , Issue.5-6 , pp. 193-196
    • Vega-Rodríguez, M.A.1    Sánchez-Pérez, J.M.2    Gómez-Pulido, J.A.3
  • 114
    • 34548859577 scopus 로고    scopus 로고
    • Analysis of an SOC architecture for MPEG reconfigurable video coding framework
    • presented at, ISCAS
    • J.-M. Hsiao and C.-J. Tsai, "Analysis of an SOC architecture for MPEG reconfigurable video coding framework," presented at IEEE Int Symp. Circ. Syst., (ISCAS), 2007.
    • (2007) IEEE Int Symp. Circ. Syst
    • Hsiao, J.-M.1    Tsai, C.-J.2
  • 116
    • 0029362492 scopus 로고    scopus 로고
    • Designing and reporting on computational experiments with heuristic methods
    • R. S. Barr, B. L. Golden, J. P. Kelly, M. G. C. Resende, and W. Stewart, "Designing and reporting on computational experiments with heuristic methods," J. Heuristics, vol. 1, pp. 9-32, 1996.
    • (1996) J. Heuristics , vol.1 , pp. 9-32
    • Barr, R.S.1    Golden, B.L.2    Kelly, J.P.3    Resende, M.G.C.4    Stewart, W.5
  • 117
    • 70349861303 scopus 로고    scopus 로고
    • J. Lampinen and I. Zelinka, On stagnation evolution algorithm, presented at the 6th Int. Mendel Conf. Soft Comput., 2000, Brno, Czech Republic. Brno Univ. Technol., Faculty of Mech. Eng., Inst. Automat. Comput. Sci., 2000.
    • J. Lampinen and I. Zelinka, "On stagnation evolution algorithm," presented at the 6th Int. Mendel Conf. Soft Comput., 2000, Brno, Czech Republic. Brno Univ. Technol., Faculty of Mech. Eng., Inst. Automat. Comput. Sci., 2000.


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