Unit commitment by an enhanced simulated annealing algorithm

Simopoulos, DN; Kavatza, SD; Vournas, CD

dc.contributor.author	Simopoulos, DN	en
dc.contributor.author	Kavatza, SD	en
dc.contributor.author	Vournas, CD	en
dc.date.accessioned	2014-03-01T02:44:21Z
dc.date.available	2014-03-01T02:44:21Z
dc.date.issued	2006	en
dc.identifier.issn	0885-8950	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31767
dc.subject	Dynamic economic dispatch (DED)	en
dc.subject	Ramp rate constraints	en
dc.subject	Simulated annealing (SA)	en
dc.subject	Unit commitment (UC)	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.other	Control parameters	en
dc.subject.other	CPU time	en
dc.subject.other	Dynamic economic dispatch	en
dc.subject.other	Economic Dispatch	en
dc.subject.other	Execution time	en
dc.subject.other	Generating unit	en
dc.subject.other	Near-optimal solutions	en
dc.subject.other	Ramp rate constraints	en
dc.subject.other	Ramp rates	en
dc.subject.other	SA algorithm	en
dc.subject.other	Simulated annealing algorithms	en
dc.subject.other	Unit commitment problem	en
dc.subject.other	Unit commitments	en
dc.subject.other	Algorithms	en
dc.subject.other	Economic analysis	en
dc.subject.other	Power generation	en
dc.subject.other	Power transmission	en
dc.subject.other	Simulated annealing	en
dc.title	Unit commitment by an enhanced simulated annealing algorithm	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/PSCE.2006.296296	en
heal.identifier.secondary	http://dx.doi.org/10.1109/PSCE.2006.296296	en
heal.identifier.secondary	4075743	en
heal.language	English	en
heal.publicationDate	2006	en
heal.abstract	A new simulated annealing (SA) algorithm combined with a dynamic economic dispatch method has been developed for solving the short-term unit commitment (UC) problem. SA is used for the scheduling of the generating units, while a dynamic economic dispatch method is applied incorporating the ramp rate constraints in the solution of the UC problem. New rules concerning the tuning of the control parameters of the SA algorithm are proposed. Three alternative mechanisms for generating feasible trial solutions in the neighborhood of the current one, contributing to the reduction of the required CPU time, are also presented. The ramp rates are taken into account by performing either a backward or a forward sequence of conventional economic dispatches with modified limits on the generating units. The proposed algorithm is considerably fast and provides feasible near-optimal solutions. Numerical simulations have proved the effectiveness of the proposed algorithm in solving large UC problems within a reasonable execution time. © 2006 IEEE.	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	2006 IEEE PES Power Systems Conference and Exposition, PSCE 2006 - Proceedings	en
dc.identifier.doi	10.1109/PSCE.2006.296296	en
dc.identifier.isi	ISI:000235017000009	en
dc.identifier.volume	21	en
dc.identifier.issue	1	en
dc.identifier.spage	193	en
dc.identifier.epage	201	en