نتایج جستجو برای: non dominated sorting ant colony optimization
تعداد نتایج: 1733749 فیلتر نتایج به سال:
Edge detection is a fundamental procedure in image processing, machine vision, and computer vision. Its application area ranges from astronomy to medicine in which isolating the objects of interest in the image is of a significant importance. However, performing edge detection is a non-trivial task for which a large number of techniques have been proposed to solve it. This paper investigates th...
Much attention has been paid to evolutionary multi-objective optimization approaches efficiently solve real-world engineering problems with multiple conflicting objectives. However, the loss of selection pressure and non-uniformity in distribution Pareto optimal solutions objective space can impede both dominance-based decomposition-based optimizers when solving many-objective problems. In this...
One of the most important issues in the field of optimizing water resources management is the optimal utilization of the dam reservoirs. In the recent decades, the optimal operation of dams has been one of the most interesting issues considered by water resources planners in the country. Due to the complexities of the typical optimization methods, employing an evolutionary algorithm is regarded...
This paper presents improved Ant Colony Optimization (ACO) algorithms for data mining. The goal of the algorithms is to extract classification rules from data. The traditional Ant Colony Optimization algorithm is enhanced with genetic operators to develop improved ACO algorithms. The genetic operators like crossover, mutation are used to develop Ant Colony Optimization with Crossover (ACOC), AC...
We explore the relation between memcomputing, namely computing with and in memory, and swarm intelligence algorithms. In particular, we show that one can design memristive networks to solve short-path optimization problems that can also be solved by ant-colony algorithms. By employing appropriate memristive elements one can demonstrate an almost one-toone correspondence between memcomputing and...
This paper examines ant colony optimization technique for edge detection. ACO is a technique to find out solutions for combinatorial optimization problem. The essential part of ACO algorithms is the combination of prior information about the structure of a solution with post information about the structure of previously obtained good solutions. Keywords Ant Colony Optimization, Edge Detectio...
In this research, a tri-objective mathematical model is proposed for the Transportation-Location-Routing problem. The model considers a three-echelon supply chain and aims to minimize total costs, maximize the minimum reliability of the traveled routes and establish a well-balanced set of routes. In order to solve the proposed model, four metaheuristic algorithms, including Multi-Objective Gre...
Travelling Salesman Problem (TSP) is a classical combinatorial optimization problem. This problem is NP-hard in nature. Meta-heuristic approaches have proved to be quite useful for approximate solution of difficult combinatorial optimization problems. Ant colony optimization is one of the popular Meta-heuristics and is unique on the basis of its distributed computation and indirect communicatio...
A hybrid ant colony optimization technique to solve the stagnation problem in grid computing is proposed in this paper. The proposed algorithm combines the techniques from Ant Colony System and Max – Min Ant System and focused on local pheromone trail update and trail limit. The agent concept is also integrated in this proposed technique for the purpose of updating the grid resource table. This...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید