ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

하모니 탐색×입자 군집 최적화 (PSO)×
분야최적화최적화
계열Process / pipelineProcess / pipeline
기원 연도20011995
창시자Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan
유형Metaheuristic population-based optimizationPopulation-based metaheuristic / swarm intelligence
원전Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2), 60–68. DOI ↗Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗
별칭HS algorithm, Harmoni Araması (Harmony Search), music-inspired optimizationPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
관련56
요약Harmony Search (HS) is a population-based metaheuristic optimization algorithm introduced by Geem, Kim, and Loganathan in 2001. It mimics the improvisation process of jazz musicians seeking a perfect state of harmony, using three operators — memory consideration, pitch adjustment, and random selection — to generate candidate solutions. The algorithm applies to both continuous and discrete variables and has found wide use in engineering design, water distribution network optimization, and combinatorial problems.Particle Swarm Optimization (PSO) is a population-based metaheuristic algorithm introduced by Kennedy and Eberhart in 1995, inspired by the collective movement of bird flocks and fish schools. Each candidate solution — called a particle — moves through the search space by updating its velocity and position based on its own best experience and the best experience of the entire swarm, enabling fast convergence across continuous optimization problems.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Harmony Search · Particle Swarm Optimization. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare