Published January 2007 | Version v1
Journal article

Non-convex economic dispatch: A direct search approach

Creators

  • 1. Department of Electrical Engineering, Ming Hsin University of Science and Technology, 1, Hsin-Hsing Road, Hsin-Fong, Hsin-Chu 30401, Taiwan (China)

Description

With increasing fuel prices and restructuring of the power industry, the non-convex economic dispatch (NED) problem may become a more important problem due to the inclusion of non-smooth cost functions. It is widely recognized that a proper schedule of available generating units may save utilities millions of dollars per year in production costs. This paper develops an enhanced direct search algorithm (EDSA) to solve the NED problem including transmission losses. The EDSA incorporates the parallel nature of evaluation programming into the direct search method to enhance its search capacity that leads to a higher probability of obtaining the global optimal solution. Many nonlinear characteristics of the generator, such as prohibited operating zones and non-convex unit cost functions can be handled properly in the direct search procedure. Several heuristic strategies are also used to improve the EDSA solution process. Numerical experiments are included to demonstrate the proposed approach can obtain a higher quality solution with better performance

Additional details

Identifiers

DOI
10.1016/j.enconman.2006.04.010;
PII
S0196-8904(06)00147-6;

Publishing Information

Journal Title
Energy Conversion and Management
Journal Volume
48
Journal Issue
1
Journal Page Range
p. 219-225
ISSN
0196-8904
CODEN
ECMADL

INIS

Country of Publication
United Kingdom
Country of Input or Organization
International Atomic Energy Agency (IAEA)
INIS RN
38016648
Subject category
S71: CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS;
Descriptors DEI
ALGORITHMS; CAPACITY; COST; ENERGY LOSSES; EVALUATION; FUELS; FUNCTIONS; INDUSTRY; NONLINEAR PROBLEMS; PERFORMANCE; PRICES; PROBABILITY; PROGRAMMING; TRANSMISSION
Descriptors DEC
LOSSES; MATHEMATICAL LOGIC

Optional Information

Copyright
Copyright (c) 2006 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.