Binary Invasive Weed Optimization Algorithm Approaches for Binary Optimization

Koc, Ismail and Nureddin, Refik and Babaoglu, Ismail and Ali Uymaz, Sait (2017) Binary Invasive Weed Optimization Algorithm Approaches for Binary Optimization. In: PROCEEDINGS of the 14th Conference on Informatics and Information Technology. Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 62-68. ISBN 978-608-4699-07-1

[img]
Preview
Text
978-608-4699-07-1_pp62-68.pdf

Download (247kB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

Invasive Weed Optimization (IWO) Algorithm which is one of the population-based optimization algorithms has been recently developed by inspired from weed colonization. In a simple yet powerful optimization algorithm called the IWO algorithm, it is aimed to imitate the stability, adaptability and randomness of weed weeds. For the optimization problems with binary structured solution space, the basic IWO algorithm should be modified because its basic version is proposed for solving continuous optimization problems. In this study, three different adapted versions of IWO, IWObin1, IWObin2 and IWObin3 for short, are proposed for binary optimization. In the proposed methods to solve binary optimization problems, despite the fact that artificial weeds in the algorithm works on the continuous solution space, each weed position is converted to binary values, before the objective function is evaluated. In the first approach, search space is binarized by utilizing mod 2 process. In the second approach, sigmoid function is used to transform continuous space into binary search space. As for the last binary approach of IWO algorithm, this approach is carried out by means of tanh function for converting to binary values. The accuracy and performance of the proposed approaches have been examined on well-known 12 benchmark instances of uncapacitated facility location problem. The results obtained by IWObin1, IWObin2 and IWObin3 are compared each other by employing well-known small, medium and large sized twelve instances of UFLPs. The performance of the proposed approaches is also analyzed and compared in terms of convergence speed and running time (CPU time). The experimental results and comparisons show that proposed algorithm is an alternative and simple binary optimization method in terms of solution quality and robustness.

Item Type: Book Section
Subjects: International Conference on Informatics and Information Technologies > Applied Mathematics
?? CIIT_ TAIN ??
Depositing User: Vangel Ajanovski
Date Deposited: 29 Nov 2017 18:32
Last Modified: 29 Nov 2017 18:32
URI: http://eprints.finki.ukim.mk/id/eprint/11376

Actions (login required)

View Item View Item