메뉴 건너뛰기




Volumn , Issue , 2012, Pages 24-28

A fast discrete gravitational search algorithm

Author keywords

Discrete optimization; FGSA; GSA

Indexed keywords

DISCRETE OPTIMIZATION; DISCRETE OPTIMIZATION PROBLEMS; FGSA; GRAVITATIONAL SEARCH ALGORITHMS; GSA; INTEGER VALUES; QUALITY OF SOLUTION; SPEED OF CONVERGENCE; TEST FUNCTIONS; UNIMODAL;

EID: 84872579659     PISSN: 21668523     EISSN: 21668531     Source Type: Conference Proceeding    
DOI: 10.1109/CIMSim.2012.28     Document Type: Conference Paper
Times cited : (28)

References (4)
  • 3
    • 44949098256 scopus 로고    scopus 로고
    • Central force optimization: A new nature inspired computational framework for multidimensional search and optimization
    • R. A. Formato," Central force optimization: a new nature inspired computational framework for multidimensional search and optimization," Studies in Computational Intelligence, vol. 129, pp. 221-238, 2008.
    • (2008) Studies in Computational Intelligence , vol.129 , pp. 221-238
    • Formato, R.A.1
  • 4
    • 77955923868 scopus 로고    scopus 로고
    • BGSA: Binary gravitational search algorithm
    • Esmat Rashedi, Hossien Nezamabadi-pour, and Saied Saryazdi, "BGSA: binary gravitational search algorithm," Nat Comput, vol. 9, pp. 727-745, 2010.
    • (2010) Nat Comput , vol.9 , pp. 727-745
    • Rashedi, E.1    Nezamabadi-Pour, H.2    Saryazdi, S.3


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