arrow
返回

An artificial algae algorithm for solving binary optimization problems

delete2017-12-28
delete43
PRE
AI
S
Sedat Korkmaz
A
Ahmet Babalık
M
Mustafa Servet Kıran *
DOI:10.1007/s13042-017-0772-7delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper focuses on modification of basic artificial algae algorithm (AAA) for solving binary optimization problems by using a new solution update rule because the agents in AAA work on continuous solution space. The candidate solution generation process of algorithm in the basic version of AAA is replaced with a mechanism that use a neighbor solution randomly selected from the population and three decision variables of this solution. The current solution is taken from the population and randomly selected three dimensions of this solution are changed using the neighbor solution. The agents of AAA work on continuous solution space and this modification for AAA is required for solving a binary optimization problem because a binary optimization problems have decision variables which are element of set {0, 1}. The performance of the proposed algorithm, binAAA for short, is investigated on the uncapacitated facility location problems which are pure binary optimization problem and there is no integer or real valued decision variables in this problem. The results obtained by binAAA are compared with the results of state-of-art algorithms such as artificial bee colony, particle swarm optimization, and genetic algorithms. Experimental results and comparisons show that the binAAA is better than the other algorithm almost all cases in terms of solution quality and robustness based on the mean and standard deviations, respectively.
Keyword:
Artificial algae algorithm
Binary optimization
Heuristic search
Uncapacitated facility location
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

International Journal of Machine Learning and Cybernetics 封面图
International Journal of Machine Learning and Cybernetics
IF:
2.7
论文数:
3.2K
被引数:
5.6K

机构

S
Selcuk University
学者数:
4.5K
论文数: 4.4K
被引数: 53
引用论文

引用论文

err分享
err收藏
A hybrid heuristic for the 0-1 Knapsack Sharing Problem0-1背包共享问题的混合启发式算法
err2015-06-01
err20
PREAI
errHaddar, Boukthir; Khemakhem, Mahdi; Hanafi, Said; Wilbaut, Christophe
err分享
err收藏
err分享
err收藏
An improved binary particle swarm optimization for unit commitment problem
err2009-05-01
err165
PREAI
errYuan, Xiaohui; Nie, Hao; So, Anjun; Wang, Liang; Yuan, Yanbin
err分享
err收藏
学者 查看更多内容