نتایج جستجو برای: continuous ant colony optimization caco algorithm
تعداد نتایج: 1256130 فیلتر نتایج به سال:
this article presents the application of two algorithms: heuristic big bang-big crunch (hbb-bc) and a heuristic particle swarm ant colony optimization (hpsaco) to discrete optimization of reinforced concrete planar frames subject to combinations of gravity and lateral loads based on aci 318-08 code. the objective function is the total cost of the frame which includes the cost of concrete, formw...
This paper proposes a Clustering-aided Ant Colony Optimization (ACO) algorithm (CACO) for fuzzy controller design. The objective of CACO is to improve both the design efficiency of a fuzzy controllers and its performance. In CACO, the number of rules in CACO is created on-line by a newly proposed fuzzy clustering. Once a new rule is generated, the consequence is selected from a list of candidat...
A direct search approach to determine optimal reservoir operating is proposed with ant colony optimization for continuous domains (ACOR). The model is applied to a system of single reservoir to determine the optimum releases during 42 years of monthly steps. A disadvantage of ant colony based methods and the ACOR in particular, refers to great amount of computer run time consumption. In this st...
A direct search approach to determine optimal reservoir operating is proposed with ant colony optimization for continuous domains (ACOR). The model is applied to a system of single reservoir to determine the optimum releases during 42 years of monthly steps. A disadvantage of ant colony based methods and the ACOR in particular, refers to great amount of computer run time consumption. In this st...
Ant colony optimization is a metaheuristic approach belonging to the model based search algorithm. It is a paradigm for designing metaheuristic algorithm for combinatorial problem. In this paper we discuss the Ant colony system. Ant colony system is one of the best algorithm of ant colony optimization. First we discuss the optimization,and one of the optimization problem is combinatiorial probl...
This paper presents a robust hybrid improved dolphin echolocation and ant colony optimization algorithm (IDEACO) for optimization of truss structures with discrete sizing variables. The dolphin echolocation (DE) is inspired by the navigation and hunting behavior of dolphins. An improved version of dolphin echolocation (IDE), as the main engine, is proposed and uses the positive attributes of an...
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...
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 optimization algorithms (ACOs) have been basically introduced to discrete variable problems and applied to different research domains in several engineering fields. Meanwhile, abundant studies have been already involved to adapt different ant models to continuous search spaces. Assessments indicate competitive performance of ACOs on discrete or continuous domains. Therefore, as poten...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید