In this paper, a constrained mean-variance model is constructed for the portfolio optimization problems. The model is a mixed quadratic integer programming problem, and it is too hard to solve by using the traditional optimal algorithms. The purpose of this paper is to use a heuristic algorithm to solve this problem. Combined with the differential evolution strategy, a new hybrid artificial bee...

Bio inspiration is a branch of artificial simulation science that shows pervasive contributions to variety of engineering fields such as automate pattern recognition, systematic fault detection and applied optimization. In this paper, a new metaheuristic optimizing algorithm that is the simulation of “The Great Salmon Run” (TGSR) is developed. The obtained results imply on the acceptable perfor...

Internet centers host services for e-banks, e-auctions and other clients. Hosting centers then must allocate servers among clients to maximize revenue. The limited number of servers, costs of reallocat-ing servers, and unpredictability of requests make server allocation optimization difficult. Based on the many similarities between server and honey bee colony forager allocation, we propose a ne...

The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic techniqu...

A new population-based search algorithm called the Bees Algorithm (BA) is presented in this paper. The algorithm mimics the food foraging behavior of swarms of honey bees. This algorithm performs a kind of neighborhood search combined with random search and can be used for both combinatorial optimization and functional optimization and with good numerical optimization results. ABC is a meta-heu...

Feature selection plays an important role in data mining and pattern recognition, especially in the case of large scale data. Feature selection is done due to large amount of noise and irrelevant features in the original data set. Hence, the efficiency of learning algorithms will increase incredibly if these irrelevant data are removed by this procedure. A novel approach for feature selection i...

The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, we present a novel application of the Artificial Bee Colony algorithm to solve the Weighted Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on th...