نتایج جستجو برای: non dominated sorting ant colony optimization
تعداد نتایج: 1733749 فیلتر نتایج به سال:
In this paper, thinking over characteristics of ant colony optimization Algorithm, taking into account the characteristics of cloud computing, combined with clonal selection algorithm (CSA) global optimum advantage of the convergence of the clonal selection algorithm (CSA) into every ACO iteration, speeding up the convergence rate, and the introduction of reverse mutation strategy, ant colony o...
Investment decision making is one of the key issues in financial management. Selecting the appropriate tools and techniques that can make optimal portfolio is one of the main objectives of the investment world. This study tries to optimize the decision making in stock selection or the optimization of the portfolio by means of the artificial colony of honey bee algorithm. To determine the effect...
Nowadays, the citrus supply chain has been motivated by both industrial practitioners and researchers due to several real-world applications. This study considers a four-echelon citrus supply chain, consisting of gardeners, distribution centers, citrus storage, and fruit market. A Mixed Integer Non-Linear Programming (MINLP) model is formulated, which seeks to minimize the total cost and maximi...
Ant colony optimization algorithm is a heuristic approach for the solution of combinatorial optimization problems. In order to solve continuous optimization models, an ant colony optimization algorithm is designed. Based on this algorithm, two hybrid intelligent algorithms combined with fuzzy simulation and neural network or integral sum approximation are introduced for solving fuzzy expected v...
An adaptive parallel ant colony optimization is presented by improving the critical factor influencing the performance of the parallel algorithm. We propose two different strategies for information exchange between processors: selection based on sorting and on difference, which make each processor choose another processor to communicate and update the pheromone adaptively. In order to increase ...
................................................................................................................................. I ACKNOWLEDGEMENTS ..................................................................................................... III TABLE OF CONTENTS ......................................................................................................... IV
The ant colony optimisation metaheuristic has shown promise on simplified artificial instances of university course timetabling problems. However, limited work has been done applying it to practical timetabling problems. In this paper, we describe the application of the ant colony optimisation to a highly constrained real–world instance of the university course timetabling problem. We present t...
This paper mainly addresses the balance control of a ball and beam system, where a pair of decoupled fuzzy sliding-mode controllers (DFSMCs) are proposed. The DFSMC has the advantage of reducing the design complexity, in which the coupling dynamics of the state-error dynamics are considered as disturbance terms. Stability analysis of the ball and beam system with DFSMCs is also discussed in det...
In this paper, we propose a variant of an ACO algorithm called the cunning Ant System (cAS). In cAS, each ant generates a solution by borrowing a part of a solution which was generated in previous iterations, instead of generating the solution entirely from pheromone density. Thus we named it, cunning ant. This cunning action reduces premature stagnation and exhibits good performance in the sea...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید