An electric vehicle (EV) may be used as energy storage which allows the bi-directional electricity flow between the vehicle's battery and the electric power grid. In order to flatten the load profile of the electricity system, EV scheduling has become a hot research topic in recent years. In this paper, we propose a new formulation of the joint scheduling of EV and Unit Commitment (UC), called EVUC. Our formulation considers the characteristics of EVs while optimizing the system total running cost. We employ Chemical Reaction Optimization (CRO), a general-purpose optimization algorithm to solve this problem and the simulation results on a widely used set of instances indicate that CRO can effectively optimize this problem.
Researchers have been using metaheuristics to solve UC and its related problems for many years. Mantawy proposed a hybrid algorithm integrating genetic algorithm, tabu search and simulated annealing to solve UC in @cite_9 . Rajan proposed an evolutionary programming-based tabu search method for the same problem in @cite_16 . Yousuf proposed a binary particle swarm optimization to solve the UC with renewable energy sources in @cite_25 . Chen proposed an expert system with elite particle swarm optimization algorithm to solve UC in @cite_5 . As CRO has been applied to solve related power system optimization problems, e.g., @cite_12 @cite_15 and has demonstrated outstanding performance, we adopt CRO to solve this EVUC problem.
@cite_9 @cite_5 @cite_15 @cite_16 @cite_25 @cite_12
2121957462 2169171797 2153263783 2165646463 2096190458 2114964570
This paper presents a two-level hierarchical approach that combines an expert system (ES) with an elite particle swarm optimization (EPSO) to solve the unit commitment (UC) problem. Existing UC solution methods have the problems of stopping at a local optimum and slow convergence when applied to large-scale, heavily constrained UC applications. In this work, an ES is developed to handle all constraints. The ES is initially used as a pre-dispatch tool to create a robust swarm. Then, the ES and EPSO are combined to seek the optimal solution. All constraints are incorporated and satisfied during the pre-dispatch and the evolution process. Hence, infeasible positions in the solution space will not be visited. The execution time of the proposed approach grows approximately linearly, rather than geometrically, with problem size. This feature is attractive in large-scale systems. The proposed approach is successfully applied to a popular test system of up to 100 units and the real Taipower 40-unit 168-h system. Both solution cost and execution time are superior to those of published methods. Total fuel costs of the proposed approach are several millions of dollars less than those of existing methods in the Taipower case. A unified view of metaheuristics This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling. It presents the main design questions for all families of metaheuristics and clearly illustrates how to implement the algorithms under a software framework to reuse both the design and code. Throughout the book, the key search components of metaheuristics are considered as a toolbox for: Designing efficient metaheuristics (e.g. local search, tabu search, simulated annealing, evolutionary algorithms, particle swarm optimization, scatter search, ant colonies, bee colonies, artificial immune systems) for optimization problems Designing efficient metaheuristics for multi-objective optimization problems Designing hybrid, parallel, and distributed metaheuristics Implementing metaheuristics on sequential and parallel machines Using many case studies and treating design and implementation independently, this book gives readers the skills necessary to solve large-scale optimization problems quickly and efficiently. It is a valuable reference for practicing engineers and researchers from diverse areas dealing with optimization or machine learning; and graduate students in computer science, operations research, control, engineering, business and management, and applied mathematics. In modern world, every industries including the power industry address technological changes. Therefore, it is necessary to keep track of international experiences and activities taking place in every field. This paper provides an overview of the concept of Unit Commitment (UC) problem with a bibliographical survey of relevant background, the present state and potential methodologies used for solving the concern problem. From the literature, UC problem can be categorized based on the system characteristics and policies applied. This paper reviews not only on regulated and deregulated power systems but also on power systems with renewable energy sources and storage system. In addition, it presents a comprehensive review of the methodologies, which covers a wide span of deterministic, meta-heuristic and hybrid approaches including multi-agent system approach. In terms of contribution, it formulates the problem clearly and describes appropriate approaches to solve the problem. The collected literature of methodologies has been divided into many sections, so that new researchers do not face any difficulty in carrying out research on UC problem under both the regulated and deregulated power industries as well as power system with renewable energy sources and storage system for next generation. An automatic Vehicle-to-Grid (V2G) technology can contribute to the utility grid. V2G technology has drawn great interest in the recent years. Success of the sophisticated automatic V2G research depends on efficient scheduling of gridable vehicles in constrained parking lots. Parking lots have constraints of space and current limits for V2G. However, V2G can reduce dependencies on small expensive units in the existing power systems as energy storage that can decrease running costs. It can efficiently manage load fluctuation, peak load; however, it increases spinning reserves and reliability. As number of gridable vehicles in V2G is much higher than small units of existing systems, unit commitment (UC) with V2G is more complex than basic UC for only thermal units. Particle swarm optimization (PSO) is proposed to solve the V2G, as PSO has been demonstrated to reliably and accurately solve complex constrained optimization problems easily and quickly without any dimension limitation and physical computer memory limit. In the proposed model, binary PSO optimizes the on off states of power generating units easily. Vehicles are presented by signed integer number instead of 0 1 to reduce the dimension of the problem. Typical discrete version of PSO has less balance between local and global searching abilities to optimize the number of charging discharging gridable vehicles in the constrained system. In the same model, balanced PSO is proposed to optimize the V2G part in the constrained parking lots. Finally, results show a considerable amount of profit for using proper scheduling of gridable vehicles in constrained parking lots. Lagrangian relaxation (LR) and general mixed integer programming (MIP) are two main approaches for solving unit commitment (UC) problems. This paper compares the LR and the state of art general MIP method for solving UC problems based on performance analysis and numerical testing. In this paper we have rigorously proved that UC is indeed an NP complete problem, and therefore it is impossible to develop an algorithm with polynomial computation time to solve it. In comparison with the general MIP methods, the LR methodology is more scaleable and efficient to obtain near optimal schedules for large scale and hard UC problems at the cost of a small percentage of deviation from the optimal solution. In particular, solving hydro generation subproblems within the LR framework can take advantages of both LR and general MIP methods and provide a synergetic combination of both approaches. The penetration of renewable distributed generation (DG) sources has been increased in active distribution networks due to their unique advantages. However, non-dispatchable DGs such as wind turbines raise the risk of distribution networks. Such a problem could be eliminated using the proper application of energy storage units. In this paper, optimal planning of batteries in the distribution grid is presented. The optimal planning determines the location, capacity and power rating of batteries while minimizing the cost objective function subject to technical constraints. The optimal long-term planning is based on the short-term optimal power flow considering the uncertainties. The point estimate method (PEM) is employed for probabilistic optimal power flow. The batteries are scheduled optimally for several purposes to maximize the benefits. A hybrid Tabu search particle swarm optimization (TS PSO) algorithm is used to solve the problem. The numerical studies on a 21-node distribution system show the advantages of the proposed methodology. The proposed approach can also be applied to the realistic sized networks when some sensitive nodes are considered as candidate locations for installing the storage units.