Loading
Cover of Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications: ICHSA 2020, Istanbul: 1275 (Advances in Intelligent Systems and Computing, 1275)

Book guide and evaluation

Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications: ICHSA 2020, Istanbul: 1275 (Advances in Intelligent Systems and Computing, 1275)

Sinan Melih Nigdeli (editor),Joong Hoon Kim (editor),Gebrail Bekdaş (editor),Anupam Yadav (editor)

English Unordered Engineering
4.6 / 5

0 reviews

2020

Published

430

pages

250

views

This book covers different aspects of real-world applications of optimization algorithms. It provides insights from the Sixth International Conference on Harmony Search, Soft Computing and Applications held at Istanbul University, Turkey, in July 2020. Harmony Search (HS) is one

Before you read

What will you get from this book?

This book covers different aspects of real-world applications of optimization algorithms. It provides insights from the Sixth International Conference on Harmony Search, Soft Computing and Applications held at Istanbul University, Turkey, in July 2020. Harmony Search (HS) is one of the most popular metaheuristic algorithms, developed in 2001 by Prof. Joong Hoon Kim and Prof. Zong Woo Geem, that mimics the improvisation process of jazz musicians to seek the best harmony. The book consists of research articles on novel and newly proposed optimization algorithms; the theoretical study of nature-inspired optimization algorithms; numerically established results of nature-inspired optimization algorithms; and real-world applications of optimization algorithms and synthetic benchmarking of optimization algorithms.

Ask this book

Your question is answered in the context of this title and author. Each answer uses 2 points.

Sign in to ask the book assistant.

Reader reviews

0 reviews, 4.6 average out of 5

No reviews yet

If you have read this book, help the next reader with your experience.

Write a review

Sign in to publish a review.

Reader questions and answers

Ask a focused question and learn from the community.

Sign in to ask or answer a question.

No questions yet

Be the first to ask a clear, useful question.