تکامل مستعمره بهینه سازی مبتنی بر تعهد واحد کلنی مورچه
|کد مقاله||سال انتشار||تعداد صفحات مقاله انگلیسی||ترجمه فارسی|
|7657||2011||8 صفحه PDF||سفارش دهید|
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله تقریباً شامل 5144 کلمه می باشد.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Applied Soft Computing, Volume 11, Issue 2, March 2011, Pages 2863–2870
Ant colony optimization (ACO) was inspired by the observation of natural behavior of real ants’ pheromone trail formation and foraging. Ant colony optimization is more suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem. Multistage decision making of ACO gives an edge over other conventional methods. This paper proposes evolving ant colony optimization (EACO) method for solving unit commitment (UC) problem. The EACO employs genetic algorithm (GA) for finding optimal set of ACO parameters, while ACO solves the UC problem. Problem formulation takes into consideration the minimum up and down time constraints, startup cost, spinning reserve, and generation limit constraints. The feasibility of the proposed approach is demonstrated on two different systems. The test results are encouraging and compared with those obtained by other methods.
Unit commitment (UC) is used to schedule the generating units for minimizing the overall cost of the power generation over the scheduled time horizon while satisfying a set of system constraints. UC problem is a nonlinear, combinatorial optimization problem. The global optimal solution can be obtained by complete enumeration, which is not applicable to large power systems due to its excessive computational time requirements . Up to now, many methods have been developed for solving the UC problem such as priority list methods  and , integer programming  and , dynamic programming (DP) ,  and , branch-and-bound methods , mixed-integer programming  and Lagrangian relaxation (LR) ,  and . These methods have only been applied to small UC problems and have required major assumptions which limit the solution space  and . Lagrange relaxation for UC problem was superior to dynamic programming due to its faster computational time. However, it suffers from numerical convergence and solution quality problems in the presence of identical units. Furthermore, solution quality of LR depends on the method to initialize and update Lagrange multipliers . Ant colony optimization (ACO) was proposed by Dorigo et al. to solve difficult combinatorial optimization problems. ACO is a random stochastic population based algorithm that simulates the behavior of ants for cooperation and learning in finding shortest paths between food sources and their nest , ,  and . In ACO, the ants’ behavior is simulated to solve the combinatorial problems such as traveling salesman problem and quadratic assignment problem  and . Artificial ant colony search algorithm is applied to solve large-scale economic dispatch problem in Ref. . In Ref. , economic dispatch of power systems was solved by generalized ant colony optimization. Ant colony search algorithm is applied to distribution network reconfiguration for loss reduction in Ref. . Ant colony search algorithm for Optimal Reactive Power Optimization is given in Ref. . The ACO is applied to solve the UC problem by Refs.  and . This paper proposes a new method, evolving ant colony optimization (EACO) for solving UC problem for a period of 24 h. In this approach, the ACO is used to obtain the unit commitment schedule and genetic algorithm technique is used to find optimal set of parameters required for ACO. The Lagrangian multiplier method is applied to obtain the economic dispatch for the 24-h schedule. To illustrate the effectiveness of the proposed method, it is tested on two different systems one with 10 and 20 units and the other with 10 units. Simulation results are presented and compared with other methods
نتیجه گیری انگلیسی
ACO is more suitable for combinatorial optimization problems. In this paper, evolving ACO is proposed and effectively implemented to solve the UC problem. The effectiveness of this proposed method is tested on two different systems. Results demonstrate that EACO is a very competent method to solve the UC problem. EACO generates better solutions because the ACO parameters are evolved instead of fixing them. EACO handles similar units effectively so that excessive spinning reserve is reduced. The results obtained from simulation are most encouraging in comparison with other methods and EACO production costs are found to be less expensive. Accordingly, EACO is very suitable for UC problem due to the production cost savings.