Ant colony optimization algorithm for continuous domains is a major research direction for ant colony optimization algorithm. In this paper, we propose a distribution model of ant colony foraging, through analysis of the relationship between the position distribution and food source in the process of ant colony foraging. We design a continuous domain optimization algorithm based on the model an...

The optimal reactive power dispatch (ORPD) problem is formulated as a combinatorial optimization problem involving nonlinear objective function with multiple local minima. In this paper, as a new approach, different ant colony optimization (ACO) algorithms are applied to the reactive power dispatch problem. Ant system (AS), the firstly introduced ant colony optimization algorithm, and its direc...

one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

Swarm intelligence is a collective effort of simple agents working locally but resulting in wonderful patterns. Labor division, decentralized control, stigmergy and self organization are the major components of swarm intelligence. Ant based clustering is inspired by brood sorting in ant colonies, an example of decentralized and self organized work. Stigmergy in ant colonies is via a chemical ph...

Today major section of automatic speaker verification (ASV) research is focused on multiple objectives like optimization of feature subset and minimization of Equal Error Rate (EER). As such, numerous systems for feature dimension reduction are proposed. This includes framework coaching and testing analysis for every feature set that could be a time esurient trip. Because of its significance, t...

Ant Colony Optimization (ACO) algorithm is a novel metaheuristic algorithm that has been widely used for different combinational optimization problem and inspired by the foraging behavior of real ant colonies. Ant Colony Optimization has strong robustness and easy to combine with other methods in optimization. In this paper, an efficient ant colony optimization algorithm with uniform mutation o...

the capacitated clustering problem (ccp) is one of the most importantcombinational optimization problems that nowadays has many real applications inindustrial and service problems. in the ccp, a given n nodes with known demandsmust be partitioned into k distinct clusters in which each cluster is detailed by anode acting as a cluster center of this cluster. the objective is to minimize the sumof...

In cooperative relay networks with multiple users and multiple potential relays, which relay nodes are selected has great impact on the system performance. It is an optimization problem for selecting suitable relay nodes. The exhaustive search can solve this problem but the complexity will increase factorially with the network size, i.e., the number of users and the number of relays in the netw...

Many scientific applications running in Cloud Computing system are workflow applications that contains large number of tasks and in which tasks are connected by precedence relations. Efficient scheduling the workflow tasks become a challenging issue in Cloud Computing environments because the scheduling decides performance of the applications. Unfortunately, finding the optimal scheduling is kn...