A simulated annealing algorithm for unit commitment

Mantawy, A.H.; Abdel-Magid, Y.L.; Selim, Shokri Z.

doi:10.1109/59.651636

Cited by 249 publications

(84 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We consider the simulated annealing algorithm as a suitable tool for the present problem, and then define the objective function as [29],…”

Section: Low Noise Spectrometer Designmentioning

confidence: 99%

A Fast Simulation Method of Silicon Nanophotonic Echelle Gratings and Its Applications in the Design of on-Chip Spectrometers

Song¹,

Chen²,

Li³

2013

PIER

View full text Add to dashboard Cite

Abstract-Due to their very high integration density, echelle grating spectrometers based on silicon nanophotonic platforms have received great attention for their applications in many areas, such as optical sensors, optical communications, and optical interconnections. The design of echelle gratings requires an effective modeling and simulation technique. Though we have used a boundary integral method to accurately analyze the polarization-dependent performance of the echelle grating, it is complicated and time-consuming for the simulation due to its large size and aperiodic structure. In the present paper, we will present a faster simulation method for the grating with twice total internal reflection facets based on a modified Kirchhoff-Huygens principle with the influence of the Goos-Hänchen shift considered. On the one hand, the presented simulation results agree well with our previous results obtained by the boundary integral method when the shift can accurately be calculated using a FDTD method. On the other hand, the biggest advantage of the new method over the existing methods is that it can also provide an insightful physical explanation for many numerical results. Finally, we will effectively apply the present method to design an on-chip spectrometer with very low noise floor.

show abstract

“…We consider the simulated annealing algorithm as a suitable tool for the present problem, and then define the objective function as [29],…”

Section: Low Noise Spectrometer Designmentioning

confidence: 99%

A Fast Simulation Method of Silicon Nanophotonic Echelle Gratings and Its Applications in the Design of on-Chip Spectrometers

Song¹,

Chen²,

Li³

2013

PIER

View full text Add to dashboard Cite

show abstract

“…They include Expert system (ES), Ant Colony search (ACS) [11], Simulated annealing (SA) [12], Artificial Neural networks (ANN) [13,14,15], Fuzzy logic (FL) [16] and Genetic Algorithm (GA) [17]. Others include Meta heuristic methods such as Tabu search (TS) [18], Particle swarm optimization (PSO) [19,20] and Evolutionary programming (EP) [21,22].…”

Section: American Journal Of Electrical and Electronic Engineeringmentioning

confidence: 99%

(Lantool) Power Generation Cost Minimization Software Application

V.I.E.¹,

Afa²

2014

AJEEE

View full text Add to dashboard Cite

Managers of large scale industry like the electricity generation are challenged at many fronts because the tasks involved are complex, influenced by unexpected events and evolve in time. Currently the application of computer methods in this industry has produced tremendous positive results. In this regard, the study presents an effort developed to solve optimal power flow (economic dispatch) problem by minimizing the cost of generation using the lagrangian multiplier method. A decision support system 'Lantool' is presented. The approach is validated by lagrangian method found in technical literatures. The system will assist operators in thermal power plants with the task of planning generation in the most economic way. A result obtained from the application explains the important role decision support systems can play in the management of the electricity generation industry.

show abstract

“…In this paper, we use the polynomial-time cooling schedule proposed by Aarts and Laarhoven in [17]. This cooling schedule leads to a polynomial-time execution of the simulated annealing, but it cannot guarantee the optimal solution [16], [17], [21]. Different parameters of the cooling schedule are determined based on the statistics calculated during the search.…”

Section: Polinomial-time Cooling Schedulementioning

confidence: 99%

An Efficient Simulated Annealing Algorithm for Network Reconfiguration in Large-Scale Distribution Systems

Jeon¹,

Lee²,

Shin³

2002

IEEE Power Eng. Rev.

View full text Add to dashboard Cite

Abstract-This paper presents an efficient algorithm for loss minimization by using an automatic switching operation in largescale distribution systems. Simulated annealing is particularly well suited for a large combinatorial optimization problem since it can avoid local minima by accepting improvements in cost. However, it often requires a meaningful cooling schedule and a special strategy, which makes use of the property of distribution systems in finding the optimal solution. In this paper, we augment the cost function with the operation condition of distribution systems, improve the perturbation mechanism with system topology, and use the polynomial-time cooling schedule, which is based on the statistical calculation during the search. The validity and effectiveness of the proposed methodology is demonstrated in the Korea Electric Power Corporation's distribution system.

show abstract

A simulated annealing algorithm for unit commitment

Cited by 249 publications

References 11 publications

A Fast Simulation Method of Silicon Nanophotonic Echelle Gratings and Its Applications in the Design of on-Chip Spectrometers

A Fast Simulation Method of Silicon Nanophotonic Echelle Gratings and Its Applications in the Design of on-Chip Spectrometers

(Lantool) Power Generation Cost Minimization Software Application

An Efficient Simulated Annealing Algorithm for Network Reconfiguration in Large-Scale Distribution Systems

Contact Info

Product

Resources

About