نتایج جستجو برای: ant colony optimization مورچگان الگوریتم
تعداد نتایج: 401032 فیلتر نتایج به سال:
the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
this paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. in addition, the setup time of a job on each machin...
In this paper, we present an improved continuous ant colony algorithm for global optimization of continuous functions. We show how to improve the quality of Ant Colony Optimization, ACO, to solve continuous optimization problems. We present the general idea, implementation, the analysis of its convergence and results obtained. We compare the results with Adaptive Genetic Algorithm, AGA, and Con...
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...
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...
Ant colony algorithm, a heuristic simulated algorithm, provides better solutions for non-convex, non-linear and discontinuous optimization problems. For ant colony algorithm, it is frequently to be trapped into local optimum, which might lead to stagnation. This article presents the city-select strategy, local pheromone update strategy, optimum solution prediction strategy and local optimizatio...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید