Does the Jaya Algorithm Really Need No Parameters?

Willa Ariela Syafruddin, Mario Köppen, Brahim Benaissa

Abstract

Jaya algorithm is a swarm optimization algorithm, formulated on the concept where the solution obtained for a given problem moves toward the best solution and away from the worst solution. Despite being a very simple algorithm, it has shown excellent performance for various application. It has been claimed that Jaya algorithm is parameter-free. Here, we want to investigate the question whether introducing parameters in Jaya might be of advantage. Results show the comparison of the results for different benchmark function, indicating that, apart from a few exceptions, generally no significant improvement of Jaya can be achieved this way. The conclusion is that we have to consider the operation of Jaya differently from a modified PSO and more in the sense of a stochastic gradient descent.

Download


Paper Citation


in Harvard Style

Syafruddin W., Köppen M. and Benaissa B. (2018). Does the Jaya Algorithm Really Need No Parameters?.In Proceedings of the 10th International Joint Conference on Computational Intelligence - Volume 1: IJCCI, ISBN 978-989-758-327-8, pages 264-268. DOI: 10.5220/0006960702640268


in Bibtex Style

@conference{ijcci18,
author={Willa Ariela Syafruddin and Mario Köppen and Brahim Benaissa},
title={Does the Jaya Algorithm Really Need No Parameters?},
booktitle={Proceedings of the 10th International Joint Conference on Computational Intelligence - Volume 1: IJCCI,},
year={2018},
pages={264-268},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006960702640268},
isbn={978-989-758-327-8},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 10th International Joint Conference on Computational Intelligence - Volume 1: IJCCI,
TI - Does the Jaya Algorithm Really Need No Parameters?
SN - 978-989-758-327-8
AU - Syafruddin W.
AU - Köppen M.
AU - Benaissa B.
PY - 2018
SP - 264
EP - 268
DO - 10.5220/0006960702640268