A meliorated Harris Hawks optimizer for combinatorial unit commitment problem with photovoltaic applications
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Abstract Conventional unit commitment problem (UCP) consists of thermal generating units and its participation schedule, which is a stimulating and significant responsibility of assigning produced electricity among the committed generating units matter to frequent limitations over a scheduled period view to achieve the least price of power generation. However, modern power system consists of various integrated power generating units including nuclear, thermal, hydro, solar and wind. The scheduling of these generating units in optimal condition is a tedious task and involves lot of uncertainty constraints due to time carrying weather conditions. This difficulties come to be too difficult by growing the scope of electrical power sector day by day, so that UCP has connection with problem in the field of optimization, it has both continuous and binary variables which is the furthermost exciting problem that needs to be solved. In the proposed research, a newly created optimizer, i.e., Harris Hawks optimizer (HHO), has been hybridized with sine–cosine algorithm (SCA) using memetic algorithm approach and named as meliorated Harris Hawks optimizer and it is applied to solve the photovoltaic constrained UCP of electric power system. In this research paper, sine–cosine Algorithm is used for provision of power generation (generating units which contribute in electric power generation for upload) and economic load dispatch (ELD) is completed by Harris Hawks optimizer. The feasibility and efficacy of operation of the hybrid algorithm are verified for small, medium power systems and large system considering renewable energy sources in summer and winter, and the percentage of cost saving for power generation is found. The results for 4 generating units, 5 generating units, 6 generating units, 7 generating units, 10 generating units, 19 generating units, 20 generating units, 40 generating units and 60 generating units are evaluated. The 10 generating units are evaluated with 5% and 10% spinning reserve. The efficacy of the offered optimizer has been verified for several standard benchmark problem including unit commitment problem, and it has been observed that the suggested optimizer is too effective to solve continuous, discrete and nonlinear optimization problems.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle