메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Particle swarm optimization with spatially meaningful neighbours

Author keywords

Delaunay triangulation; Heuristics; Neighbour topology; Particle swarm optimization

Indexed keywords

DELAUNAY TRIANGULATION; HEURISTICS; INTRINSIC PROPERTIES; LOW DIMENSIONS; NATURAL NEIGHBOURS; NEIGHBOUR TOPOLOGY; NEIGHBOURHOOD TOPOLOGIES; PARTICLE SWARM OPTIMIZATION; PARTICLE SWARM OPTIMIZER; SPATIAL POSITIONS;

EID: 57649178211     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIS.2008.4668281     Document Type: Conference Paper
Times cited : (42)

References (24)
  • 3
    • 27144487201 scopus 로고    scopus 로고
    • What makes a successful society? experiments with population topologies in particle swarms
    • R. Mendes and J. Neves, "What makes a successful society? experiments with population topologies in particle swarms," in SBIA, 2004, pp. 346-355.
    • (2004) SBIA , pp. 346-355
    • Mendes, R.1    Neves, J.2
  • 6
    • 33745616837 scopus 로고    scopus 로고
    • A. S. Mohais, R. Mendes, C. Ward, and C. Posthoff, Neighborhood restructuring in particle swarm optimization. in Australian Conference on Artificial Intelligence, ser. Lecture Notes in Computer Science, S. Zhang and R. Jarvis, Eds., 3809. Springer, 2005, pp. 776-785.
    • A. S. Mohais, R. Mendes, C. Ward, and C. Posthoff, "Neighborhood restructuring in particle swarm optimization." in Australian Conference on Artificial Intelligence, ser. Lecture Notes in Computer Science, S. Zhang and R. Jarvis, Eds., vol.. 3809. Springer, 2005, pp. 776-785.
  • 8
    • 34249068297 scopus 로고    scopus 로고
    • R. Britz, A. Engelbrecht, and F. V. den. Bergh, Locating multiple optima using particle swarm optimization, Applied Mathematics and Computation, 2007.
    • R. Britz, A. Engelbrecht, and F. V. den. Bergh, "Locating multiple optima using particle swarm optimization," Applied Mathematics and Computation, 2007.
  • 10
    • 0032046585 scopus 로고    scopus 로고
    • Dewall a fast divide and conquer delaunay triangulation algorithm in ed
    • April
    • P. Cignoniz, C. Montaniz, and R. Scopigno, "Dewall a fast divide and conquer delaunay triangulation algorithm in ed," Computer-Aided Design 30, pp. 333-341, April 1997.
    • (1997) Computer-Aided Design , vol.30 , pp. 333-341
    • Cignoniz, P.1    Montaniz, C.2    Scopigno, R.3
  • 11
    • 84968791828 scopus 로고    scopus 로고
    • Dense point sets have sparse delaunay triangulations
    • Philadelphia, PA, USA: Society for Industrial and Applied Mathematics
    • J. Erickson, "Dense point sets have sparse delaunay triangulations"," in SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2002, pp. 125-134.
    • (2002) SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms , pp. 125-134
    • Erickson, J.1
  • 12
    • 0036464756 scopus 로고    scopus 로고
    • The particle swarm - explosion, stability, and convergence in. a multidimensional complex space
    • M. Clerc and J. Kennedy, "The particle swarm - explosion, stability, and convergence in. a multidimensional complex space," IEEE Transactions on Evolutionary Computation 6, pp. 58-73, 2002.
    • (2002) IEEE Transactions on Evolutionary Computation , vol.6 , pp. 58-73
    • Clerc, M.1    Kennedy, J.2
  • 13
    • 3142781923 scopus 로고    scopus 로고
    • The fully informed particle swarm.: Simpler, maybe better
    • R. Mendes, J. Kennedy, and J. Neves, "The fully informed particle swarm.: Simpler, maybe better." IEEE Trans. Evolutionary Computation, vol. 8, no. 3, pp. 204-210, 2004.
    • (2004) IEEE Trans. Evolutionary Computation , vol.8 , Issue.3 , pp. 204-210
    • Mendes, R.1    Kennedy, J.2    Neves, J.3


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