Improved Binary Artificial Bee Colony Algorithm
- URL: http://arxiv.org/abs/2003.11641v2
- Date: Mon, 20 Apr 2020 17:27:22 GMT
- Title: Improved Binary Artificial Bee Colony Algorithm
- Authors: Rafet Durgut
- Abstract summary: The Artificial Bee Colony (ABC) algorithm is an evolutionary optimization algorithm based on swarm intelligence.
We improve the ABC algorithm to solve binary optimization problems and call it the improved binary Artificial Bee Colony (ibinABC)
The proposed method consists of an update mechanism based on fitness values and processing different number of decision variables.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Artificial Bee Colony (ABC) algorithm is an evolutionary optimization
algorithm based on swarm intelligence and inspired by the honey bees' food
search behavior. Since the ABC algorithm has been developed to achieve optimal
solutions by searching in the continuous search space, modification is required
to apply this method to binary optimization problems. In this paper, we improve
the ABC algorithm to solve binary optimization problems and call it the
improved binary Artificial Bee Colony (ibinABC). The proposed method consists
of an update mechanism based on fitness values and processing different number
of decision variables. Thus, we aim to prevent the ABC algorithm from getting
stuck in a local minimum by increasing its exploration ability. We compare the
ibinABC algorithm with three variants of the ABC and other meta-heuristic
algorithms in the literature. For comparison, we use the wellknown OR-Library
dataset containing 15 problem instances prepared for the uncapacitated facility
location problem. Computational results show that the proposed method is
superior to other methods in terms of convergence speed and robustness. The
source code of the algorithm will be available on GitHub after reviewing
process
Related papers
- A Three-Stage Algorithm for the Closest String Problem on Artificial and Real Gene Sequences [39.58317527488534]
Closest String Problem is an NP-hard problem that aims to find a string that has the minimum distance from all sequences that belong to the given set of strings.
In this paper, we introduce a three-stage algorithm that comprises the following process: first, we apply a novel alphabet pruning method to reduce the search space for effectively finding promising search regions.
Second, a variant of beam search to find a solution is employed. This method utilizes a newly developed guiding function based on an expected distance score of partial solutions.
arXiv Detail & Related papers (2024-07-17T21:26:27Z) - Improved discrete particle swarm optimization using Bee Algorithm and multi-parent crossover method (Case study: Allocation problem and benchmark functions) [0.3683202928838613]
This paper proposes the onlooker multi-parent crossover discrete particle swarm optimization (OMPCDPSO)
We performed an independent and intensive neighborhood search using the onlooker bees of the bee algorithm.
The developed algorithm in this research (OMCDPSO) in 36 test functions out of 47 (76.60%) is better than other algorithms.
arXiv Detail & Related papers (2024-03-15T21:08:37Z) - HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection [75.84584400866254]
We propose a new algorithm selector leveraging special forests, combining the strengths of both approaches while alleviating their weaknesses.
HARRIS' decisions are based on a forest model, whose trees are created based on optimized on a hybrid ranking and regression loss function.
arXiv Detail & Related papers (2022-10-31T14:06:11Z) - OptABC: an Optimal Hyperparameter Tuning Approach for Machine Learning
Algorithms [1.6114012813668934]
OptABC is proposed to help ABC algorithm in faster convergence toward a near-optimum solution.
OptABC integrates artificial bee colony algorithm, K-Means clustering, greedy algorithm, and opposition-based learning strategy.
Experimental results demonstrate the effectiveness of OptABC compared to existing approaches in the literature.
arXiv Detail & Related papers (2021-12-15T22:33:39Z) - A Fully Single Loop Algorithm for Bilevel Optimization without Hessian
Inverse [121.54116938140754]
We propose a new Hessian inverse free Fully Single Loop Algorithm for bilevel optimization problems.
We show that our algorithm converges with the rate of $O(epsilon-2)$.
arXiv Detail & Related papers (2021-12-09T02:27:52Z) - Machine Learning for Online Algorithm Selection under Censored Feedback [71.6879432974126]
In online algorithm selection (OAS), instances of an algorithmic problem class are presented to an agent one after another, and the agent has to quickly select a presumably best algorithm from a fixed set of candidate algorithms.
For decision problems such as satisfiability (SAT), quality typically refers to the algorithm's runtime.
In this work, we revisit multi-armed bandit algorithms for OAS and discuss their capability of dealing with the problem.
We adapt them towards runtime-oriented losses, allowing for partially censored data while keeping a space- and time-complexity independent of the time horizon.
arXiv Detail & Related papers (2021-09-13T18:10:52Z) - Searching for a practical evidence of the No Free Lunch theorems [0.0]
According to the No Free Lunch (NFL) theorems all black-box algorithms perform equally well when compared over the entire set of optimization problems.
We will evolve test functions for which a given algorithm A is better than another given algorithm B.
arXiv Detail & Related papers (2021-08-21T19:28:48Z) - Provably Faster Algorithms for Bilevel Optimization [54.83583213812667]
Bilevel optimization has been widely applied in many important machine learning applications.
We propose two new algorithms for bilevel optimization.
We show that both algorithms achieve the complexity of $mathcalO(epsilon-1.5)$, which outperforms all existing algorithms by the order of magnitude.
arXiv Detail & Related papers (2021-06-08T21:05:30Z) - Double Coverage with Machine-Learned Advice [100.23487145400833]
We study the fundamental online $k$-server problem in a learning-augmented setting.
We show that our algorithm achieves for any k an almost optimal consistency-robustness tradeoff.
arXiv Detail & Related papers (2021-03-02T11:04:33Z) - Critical Analysis: Bat Algorithm based Investigation and Application on
Several Domains [1.1802674324027231]
The idea of the algorithm was taken from the echolocation ability of bats.
Bat Algorithm is given in-depth in terms of backgrounds, characteristics, limitations.
arXiv Detail & Related papers (2021-01-18T19:25:12Z) - Towards Optimally Efficient Tree Search with Deep Learning [76.64632985696237]
This paper investigates the classical integer least-squares problem which estimates signals integer from linear models.
The problem is NP-hard and often arises in diverse applications such as signal processing, bioinformatics, communications and machine learning.
We propose a general hyper-accelerated tree search (HATS) algorithm by employing a deep neural network to estimate the optimal estimation for the underlying simplified memory-bounded A* algorithm.
arXiv Detail & Related papers (2021-01-07T08:00:02Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.