Binary tree-seed algorithms with S-shaped and V-shaped transfer functions
AbstractTree-seed algorithm (TSA) is a nature-inspired metaheuristic optimization algorithm. TSA is proposed for solving continuous optimization problems. In this work, TSA is modified with transfer functions for solving binary optimization problems. Continuous search space is mapped to binary search space with transfer functions. Four S-shaped and four V-shaped transfer functions are used for discretization. Uncapacitated facility location problem (UFLP) is a pure binary optimization problem. In order to measure the performance, 15 different sized (small, medium, large and extra-large) UFLPs are solved with eight different binary TSA in this work. Experimental results show that S-shaped transfer functions are better than V-shaped transfer functions on these problem sets.
Copyright (c) 2019 International Journal of Intelligent Systems and Applications in Engineering
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.