Unit commitment with ramp rate constraints using the simulated annealing algorithm

Simopoulos, D; Contaxis, G

dc.contributor.author	Simopoulos, D	en
dc.contributor.author	Contaxis, G	en
dc.date.accessioned	2014-03-01T02:43:00Z
dc.date.available	2014-03-01T02:43:00Z
dc.date.issued	2004	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31187
dc.subject	Generation scheduling	en
dc.subject	Ramp rate constraints	en
dc.subject	Simulated annealing	en
dc.subject	Unit commitment	en
dc.subject.other	Algorithms	en
dc.subject.other	Constraint theory	en
dc.subject.other	Mathematical models	en
dc.subject.other	Mathematical programming	en
dc.subject.other	Optimization	en
dc.subject.other	Simulated annealing	en
dc.subject.other	Generation scheduling	en
dc.subject.other	Ramp rate constraints	en
dc.subject.other	Unit commitment	en
dc.subject.other	Problem solving	en
dc.title	Unit commitment with ramp rate constraints using the simulated annealing algorithm	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/MELCON.2004.1348078	en
heal.identifier.secondary	http://dx.doi.org/10.1109/MELCON.2004.1348078	en
heal.publicationDate	2004	en
heal.abstract	A Simulated Annealing (SA) algorithm has been developed for solving the unit commitment (UC) problem. The algorithm is used for the scheduling of the generating units, while a quadratic programming routine carries out the economic dispatch. New rules concerning the cooling schedule and the random generation of the initial solution of the system are presented. A new approach for generating feasible neighboring solutions contributes to the reduction of the required CPU time. Ramp rate constraints have also been added in order to obtain more realistic results. Numerical simulations have proved the effectiveness of the proposed model.	en
heal.journalName	Proceedings of the Mediterranean Electrotechnical Conference - MELECON	en
dc.identifier.doi	10.1109/MELCON.2004.1348078	en
dc.identifier.volume	3	en
dc.identifier.spage	845	en
dc.identifier.epage	849	en