An efficient approach by adjusting bounds for heuristic optimization algorithms

SOFUOĞLU M. A., ÇAKIR F. H., GÜRGEN S.

SOFT COMPUTING, cilt.23, sa.13, ss.5199-5212, 2019 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 23 Sayı: 13
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1007/s00500-018-3327-2
  • Dergi Adı: SOFT COMPUTING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.5199-5212
  • Anahtar Kelimeler: Heuristic optimization, Accelerated particle swarm algorithm, Multi-pass turning operation model, Tension spring design problem, Welded beam design, PARTICLE SWARM OPTIMIZATION, MULTIPASS TURNING OPERATIONS, DESIGN OPTIMIZATION, STRUCTURAL DESIGN, GENETIC ALGORITHMS, SUPPORT, SEARCH
  • Eskişehir Osmangazi Üniversitesi Adresli: Evet

Özet

In this article, a novel method is suggested for solving heuristic optimization problems. A pre-study was performed to define proper bounds. Different problems with these bounds were solved using genetic, accelerated particle swarm, and cuckoo search algorithms. Three different problems (multi-pass turning, welded beam design, and tension spring) were used as case studies. The results of the studies were compared with the earlier studies. As a result, the proposed method requires less computing time and has better objective function values compared to the solutions in the literature. The proposed method provides effective decision-making for operators and engineers dealing with different design and manufacturing environments in terms of cost and time.