نتایج جستجو برای: single-objective, ant colony optimization
تعداد نتایج: 1696902 فیلتر نتایج به سال:
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
distribution centers (dcs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.this paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. an evolutionary algorithm named non-dominated sorting ant colony optimization (nsaco) is used as the optimi...
In this paper, an efficient multi-objective model is proposed to solve time-cost trade off problem considering cash flows. The proposed multi-objective meta-heuristic is based on Ant colony optimization and is called Non Dominated Archiving Ant Colony Optimization (NAACO). The significant feature of this work is consideration of uncertainties in time, cost and more importantly interest rate. A ...
optimization of reservoir parameters is an important issue in petroleum exploration and production. the ant colony optimization(aco) is a recent approach to solve discrete and continuous optimization problems. in this paper, the ant colony optimization is usedas an intelligent tool to estimate reservoir rock properties. the methodology is illustrated by using a case study on shear wave velocity...
in this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. two objective functions, real power loss and energy not supplied index (ens), were utilized. multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...
Evolutionary Computation niching methods, such as Fitness Sharing and Crowding, are aimed at simultaneously locating and maintaining multiple optima to increase search robustness, typically in multi-modal function optimization. Such methods have been shown to be useful for both single and multiple objective optimisation problems. Niching methods have been adapted in recent years for other optim...
Most of the research on job shop scheduling problem are concerned with minimization of a single objective. However, the real world applications of job shop scheduling problems are involved in optimizing multiple objectives. Therefore, in recent years ant colony optimization algorithms have been proposed to solve job shop scheduling problems with multiple objectives. In this paper, some recent m...
many real world problems can be modelled as an optimization problem. evolutionary algorithms are used to solve these problems. ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. these ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. ant colony optim...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید