Generation maintenance scheduling in power systems using ant colony optimization for continuous domains based 0-1 integer programming
نویسندگان
چکیده
In this paper, we present a formulation that enables Ant Colony Optimization for Continuous Domains (ACOR) to seek the optimal solution of the unit maintenance scheduling problem. ACOR is a direct extension of Ant Colony Optimization (ACO). Also it is the significant ant-based algorithm for continuous optimization. For the maintenance scheduling, cost reduction is as important as reliability. The objective function of this algorithm considers the effect of economy as well as reliability. Various constraints such as spinning reserve, duration of maintenance crew are being taken into account. The ACOR formulation developed is applied on a power system with six generating units. The simulation result of this technique is compared with those reported in literature. The outcome is very encouraging and proves that the authors’ proposed approach outperforms them in terms of reaching a better optimal solution and speed. 2011 Elsevier Ltd. All rights reserved.
منابع مشابه
Size optimization for hybrid photovoltaic-wind energy system using ant colony optimization for continuous domains based integer programming
In this paper, ant colony optimization for continuous domains (ACOR) based integer programming is employed for size optimization in a hybrid photovoltaic (PV)–wind energy system. ACOR is a direct extension of ant colony optimization (ACO). Also, it is the significant ant-based algorithm for continuous optimization. In this setting, the variables are first considered as real then rounded in each...
متن کاملA new approach for maintenance scheduling of generating units in electrical power systems based on their operational hours
Generator maintenance scheduling (GMS) determines the outage periods of generating units in a oneyear or two-year planning horizon for regular safety inspection. This paper introduces a new practical GMS for centralized electrical power systems in which, in contrary to previous studies, the outage periods are scheduled based on operational hours of units. Predefined minimum and maximum operatin...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Expert Syst. Appl.
دوره 38 شماره
صفحات -
تاریخ انتشار 2011