메뉴 건너뛰기




Volumn , Issue , 2009, Pages 49-55

Visualizing the search process of particle swarm optimization

Author keywords

Data mapping; Particle swarm optimization; Visualization

Indexed keywords

DATA MAPPING; DATA MAPPINGS; DISTANCE-PRESERVING MAPPINGS; FUNCTION OPTIMIZATION PROBLEMS; HARD PROBLEMS; HIGH-DIMENSIONAL; SEARCH PROCESS;

EID: 72749086607     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569909     Document Type: Conference Paper
Times cited : (14)

References (25)
  • 2
    • 84901421400 scopus 로고    scopus 로고
    • The swarm and the queen: towards a\ deterministic and adaptive particle swarm optimization
    • M. Clerc. The swarm and the queen: towards a\ deterministic and adaptive particle swarm optimization. In Proceedings of the IEEE Congress on Evolutionary Computation, pages 1951-1957, 1999.
    • (1999) Proceedings of the IEEE Congress on Evolutionary Computation , pp. 1951-1957
    • Clerc, M.1
  • 3
    • 33746784926 scopus 로고    scopus 로고
    • Genotypic-space mapping: Population visualization for genetic algorithms. The Knowledge Media Institute, The Open University, Milton Keynes, UK
    • Technical Report KMI-TR-39, 30th September
    • T. D. Collins. Genotypic-space mapping: Population visualization for genetic algorithms. The Knowledge Media Institute, The Open University, Milton Keynes, UK, Technical Report KMI-TR-39, 30th September 1996.
    • (1996)
    • Collins, T.D.1
  • 4
    • 0031270961 scopus 로고    scopus 로고
    • Sammon's mapping using neural networks: A comparison
    • D. De Ridder and R. Duin. Sammon's mapping using neural networks: a comparison. Pattern Recognition Letters, 18(11-13):1307-1316, 1997.
    • (1997) Pattern Recognition Letters , vol.18 , Issue.11-13 , pp. 1307-1316
    • De Ridder, D.1    Duin, R.2
  • 6
    • 0028466625 scopus 로고
    • How to make Sammon mapping useful for multidimensional data structures analysis
    • W. Dzwinel. How to make Sammon mapping useful for multidimensional data structures analysis. Pattern Recognition, 27(7):949-959, 1994.
    • (1994) Pattern Recognition , vol.27 , Issue.7 , pp. 949-959
    • Dzwinel, W.1
  • 10
    • 0035415170 scopus 로고    scopus 로고
    • GAVEL - a new tool for genetic algorithm visualization
    • E. Hart and P. Ross. GAVEL - a new tool for genetic algorithm visualization. IEEE Transactions on Evolutionary Computation, 5(4):335-348, 2001.
    • (2001) IEEE Transactions on Evolutionary Computation , vol.5 , Issue.4 , pp. 335-348
    • Hart, E.1    Ross, P.2
  • 13
    • 0031674071 scopus 로고    scopus 로고
    • Matching algorithms to problems: An experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator
    • J. Kennedy and W. M. Spears. Matching algorithms to problems: An experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 78-83, 1998.
    • (1998) Proceedings of the IEEE International Conference on Evolutionary Computation , pp. 78-83
    • Kennedy, J.1    Spears, W.M.2
  • 18
    • 0000204592 scopus 로고    scopus 로고
    • Visualization of evolutionary algorithms - set of standard techniques and multidimensional visualization
    • H. Pohlheim. Visualization of evolutionary algorithms - set of standard techniques and multidimensional visualization. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 533-540, 1999.
    • (1999) Proceedings of the Genetic and Evolutionary Computation Conference , pp. 533-540
    • Pohlheim, H.1
  • 19
    • 84887006810 scopus 로고
    • A non-linear mapping for data structure analysis
    • J. W. Sammon, Jr. A non-linear mapping for data structure analysis. IEEE Transactions on Computers, 18:401-409, 1969.
    • (1969) IEEE Transactions on Computers , vol.18 , pp. 401-409
    • Sammon Jr., J.W.1
  • 23
    • 33645681469 scopus 로고    scopus 로고
    • A study of ACO capabilities for solving the maximum clique problem
    • C. Solnon and S. Fenet. A study of ACO capabilities for solving the maximum clique problem. Journal of Heuristics, 12(3):155-180, 2006.
    • (2006) Journal of Heuristics , vol.12 , Issue.3 , pp. 155-180
    • Solnon, C.1    Fenet, S.2
  • 24
    • 0035309102 scopus 로고    scopus 로고
    • Search space boundary extension method in real-coded genetic algorithms
    • S. Tsutsui and D. E. Goldberg. Search space boundary extension method in real-coded genetic algorithms. Information Sciences, 133(3-4):229-247, 2001.
    • (2001) Information Sciences , vol.133 , Issue.3-4 , pp. 229-247
    • Tsutsui, S.1    Goldberg, D.E.2


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