ScholarGate
Trợ lý

So sánh phương pháp

Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.

Tối ưu hóa Lượng tử×Thuật toán di truyền×Thuật toán Harmony Search×
Lĩnh vựcTối ưu hóaTối ưu hóaTối ưu hóa
HọProcess / pipelineProcess / pipelineProcess / pipeline
Năm ra đời199719752001
Người khởi xướngRainer Storn & Kenneth PriceJohn Henry HollandZong Woo Geem, Joong Hoon Kim, G. V. Loganathan
LoạiPopulation-based stochastic metaheuristicPopulation-based metaheuristicMetaheuristic population-based optimization
Công trình gốcStorn, R. & Price, K. (1997). Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. Journal of Global Optimization, 11(4), 341–359. DOI ↗Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2), 60–68. DOI ↗
Tên gọi khácDE algorithm, Diferansiyel Evrim (DE), DE optimizationGA, evolutionary algorithm, Genetik Algoritma — Evrimsel OptimizasyonHS algorithm, Harmoni Araması (Harmony Search), music-inspired optimization
Liên quan555
Tóm tắtDifferential Evolution (DE), introduced by Rainer Storn and Kenneth Price in 1997, is a population-based stochastic optimisation algorithm designed for continuous parameter spaces. It generates candidate solutions by combining vector differences between existing population members, making it a powerful and parameter-lean alternative to Genetic Algorithms and Particle Swarm Optimisation when the search landscape is non-convex, multimodal, or poorly suited to gradient-based methods.A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail.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.
ScholarGateBộ dữ liệu
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED

Đến trang tìm kiếm Tải xuống bản trình chiếu

ScholarGateSo sánh phương pháp: Differential Evolution · Genetic Algorithm · Harmony Search. Truy cập ngày 2026-06-17 từ https://scholargate.app/vi/compare