A Comparative Study of Three Different Mathematical Methods for Solving the Unit Commitment Problem
The unit commitment (UC) problem which is an important subject in power system engineering is solved by using Lagragian relaxation (LR), penalty function (PF), and augmented Lagrangian penalty function (ALPF) methods due to their higher solution quality and faster computational time than metaheurist...
Saved in:
| Published in | Mathematical Problems in Engineering Vol. 2009; no. 1; pp. 1053 - 1065-62 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Hindawi Limiteds
01.01.2009
Hindawi Publishing Corporation |
| Online Access | Get full text |
| ISSN | 1024-123X 1026-7077 1563-5147 1563-5147 |
| DOI | 10.1155/2009/368024 |
Cover
| Abstract | The unit commitment (UC) problem which is an important subject in power system engineering is solved by using Lagragian relaxation (LR), penalty function (PF), and augmented Lagrangian penalty function (ALPF) methods due to their higher solution quality and faster computational time than metaheuristic approaches. This problem is considered to be a nonlinear programming-(NP-) hard problem because it is nonlinear, mixed-integer, and nonconvex. These three methods used for solving the problem are based on dual optimization techniques. ALPF method which combines the algorithmic aspects of both LR and PF methods is firstly used for solving the UC problem. These methods are compared to each other based on feasible schedule for each stage, feasible cost, dual cost, duality gap, duration time, and number of iterations. The numerical results show that the ALPF method gives the best duality gap, feasible and dual cost instead of worse duration time and the number of iterations. The four-unit Tuncbilek thermal plant which is located in Kutahya region in Turkey is chosen as a test system in this study. The programs used for all the analyses are coded and implemented using general algebraic modeling system (GAMS). |
|---|---|
| AbstractList | The unit commitment (UC) problem which is an important subject in power system engineering is solved by using Lagragian relaxation (LR), penalty function (PF), and augmented Lagrangian penalty function (ALPF) methods due to their higher solution quality and faster computational time than metaheuristic approaches. This problem is considered to be a nonlinear programming-(NP-) hard problem because it is nonlinear, mixed-integer, and nonconvex. These three methods used for solving the problem are based on dual optimization techniques. ALPF method which combines the algorithmic aspects of both LR and PF methods is firstly used for solving the UC problem. These methods are compared to each other based on feasible schedule for each stage, feasible cost, dual cost, duality gap, duration time, and number of iterations. The numerical results show that the ALPF method gives the best duality gap, feasible and dual cost instead of worse duration time and the number of iterations. The four-unit Tuncbilek thermal plant which is located in Kutahya region in Turkey is chosen as a test system in this study. The programs used for all the analyses are coded and implemented using general algebraic modeling system (GAMS). |
| Author | Mehmet Kurban Ümmühan Başaran Filik |
| Author_xml | – sequence: 1 givenname: Mehmet surname: Kurban fullname: Kurban, Mehmet – sequence: 2 givenname: Ümmühan surname: Başaran Filik fullname: Başaran Filik, Ümmühan |
| BookMark | eNqFkctOAyEUhonRxHpZ-QKs1VEODDNlaeo10ahpTdwROgVLMwMNQ2v69jKOG03UDef2_Yfws4e2nXcaoSMgZwCcn1NCxDkrhoTmW2gAvGAZh7zcTnlqZUDZ6y7aa9sFIRQ4DAeousAj3yxVUNGuNR7H1WyDvcGTedAaX1pjdNAu4gcV57pJUKVq_KDj3M9abHzAY1-vrXvDaYxfnI3dusbGphM9BT-tdXOAdoyqW334FffRy_XVZHSb3T_e3I0u7jPFShGzGSuZoCByQUqoBDfTkue8mgo-1KKkeWVy0DmYshAGCs4TWLGOFJBzPWVsH532e1duqTbvqq7lMthGhY0EIjuDZGeQ7A1KOPR4FXzbBm1kZWN6oXcxKFv_ojn5ofn7huOenls3U-_2H_i5h5UNNlq58Kvgkl3yiRIoAKBMn_apgC6kktGuVXwvgHCWjoLLgrIPNiuZAw |
| CitedBy_id | crossref_primary_10_1155_2010_295645 crossref_primary_10_1016_j_epsr_2015_03_002 crossref_primary_10_1155_2012_178193 crossref_primary_10_1155_2010_159429 crossref_primary_10_1155_2014_708275 |
| Cites_doi | 10.1016/S0142-0615(00)00090-9 10.1109/59.651636 10.1023/A:1017960507177 10.1049/ip-gtd:20000303 10.1109/TPWRS.1987.4335151 10.1109/59.207310 10.1049/ip-gtd:19952215 10.1080/10241230211378 10.1109/59.801925 10.1049/iet-gtd:20060321 10.1109/PES.2005.1489390 10.1109/59.41687 10.1109/PTC.2001.964747 10.1109/59.76714 10.1016/0378-7796(96)01036-X 10.1109/59.744490 10.1109/PESW.2002.984954 10.1109/59.982197 10.1109/59.485989 10.1109/59.871739 10.1109/TPWRS.2003.820707 10.1109/TPWRS.2002.805003 10.1109/59.708832 10.1016/S0045-7906(99)00037-3 10.1109/PES.2003.1270468 10.1109/TPWRS.2003.821472 10.1109/59.207311 10.1109/TPWRS.2005.857286 10.1109/TPWRS.2005.857391 10.1109/59.589634 10.1109/59.141764 10.1109/IJCNN.2002.1005493 10.1109/59.466524 |
| ContentType | Journal Article |
| Copyright | Copyright © 2009 |
| Copyright_xml | – notice: Copyright © 2009 |
| DBID | 188 RHU RHW RHX AAYXX CITATION ADTOC UNPAY |
| DOI | 10.1155/2009/368024 |
| DatabaseName | CEPS中文電子期刊 Hindawi Publishing Complete Hindawi Publishing Subscription Journals Hindawi Publishing Open Access CrossRef Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: RHX name: Hindawi Publishing Open Access url: http://www.hindawi.com/journals/ sourceTypes: Publisher – sequence: 2 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences |
| EISSN | 1563-5147 |
| Editor | Júdice, Joaquim J. |
| Editor_xml | – sequence: 1 givenname: Joaquim J. surname: Júdice fullname: Júdice, Joaquim J. |
| EndPage | 1065-62 |
| ExternalDocumentID | 10.1155/2009/368024 10_1155_2009_368024 P20161117002_200912_201703270026_201703270026_1053_1065_62 |
| GroupedDBID | -~9 188 24P 29M 2UF 2WC 3V. 4.4 5GY 5VS 8FE 8FG 8R4 8R5 AAFWJ AAJEY ABDBF ABJCF ABUWG ACIPV ACIWK ADBBV AENEX AFKRA AINHJ ALMA_UNASSIGNED_HOLDINGS ARAPS BCNDV BENPR BGLVJ BPHCQ C1A CAHYU CCPQU CNMHZ CS3 CWDGH E3Z EBS EJD ESX GROUPED_DOAJ H13 HCIFZ I-F IAO IEA IL9 IOF IPNFZ K6V K7- KQ8 L6V M7S MK~ M~E OK1 P2P P62 PIMPY PQQKQ PROAC PTHSS Q2X REM RHU RHX RIG RNS TR2 TUS UGNYK XSB YQT ~8M RHW 0R~ AAMMB AAYXX ACCMX AEFGJ AFFNX AGXDD AIDQK AIDYY CAG CITATION COF OVT PHGZM PHGZT PQGLB PUEGO ADTOC UNPAY |
| ID | FETCH-LOGICAL-a379t-d373921949071c95fb7545cb958e9724cf41e41f769f1655949c371c99145eb33 |
| IEDL.DBID | RHX |
| ISSN | 1024-123X 1026-7077 1563-5147 |
| IngestDate | Wed Oct 01 15:35:32 EDT 2025 Wed Oct 01 04:12:51 EDT 2025 Thu Apr 24 23:03:27 EDT 2025 Sun Jun 02 18:53:14 EDT 2024 Tue Oct 01 22:50:59 EDT 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a379t-d373921949071c95fb7545cb958e9724cf41e41f769f1655949c371c99145eb33 |
| OpenAccessLink | https://dx.doi.org/10.1155/2009/368024 |
| PageCount | 13 |
| ParticipantIDs | unpaywall_primary_10_1155_2009_368024 crossref_citationtrail_10_1155_2009_368024 crossref_primary_10_1155_2009_368024 hindawi_primary_10_1155_2009_368024 airiti_journals_P20161117002_200912_201703270026_201703270026_1053_1065_62 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2009-01-01 |
| PublicationDateYYYYMMDD | 2009-01-01 |
| PublicationDate_xml | – month: 01 year: 2009 text: 2009-01-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Mathematical Problems in Engineering |
| PublicationYear | 2009 |
| Publisher | Hindawi Limiteds Hindawi Publishing Corporation |
| Publisher_xml | – name: Hindawi Limiteds – name: Hindawi Publishing Corporation |
| References | (35) 1992; 7 BazaraaM. S.SheraliH. D.ShettyC. M.Nonlinear Programming: Theory and Algorithms19932ndHoboken, NJ, USAJohn Wiley & SonsMR2218478ZBL0774.90075 VianaA.SousaJ. P.MatosM.Simulated annealing for the unit commitment problem2Proceedings of IEEE Porto Power Tech ConferenceSeptember 2001Porto, Portugal1410.1109/PTC.2001.964747 GuanX.ZhaiQ.PapalexopoulosA.Optimization based methods for unit commitment: Lagrangian relaxation versus general mixed integer programming2Proceedings of IEEE/PES Summer MeetingJuly 2003Toronto, Canada1095110010.1109/PES.2003.1270468 SriyanyongP.SongY. H.Unit commitment using particle swarm optimization combined with Lagrange relaxation3Proceedings of IEEE/PES General MeetingJune 2005San Francisco, Calif, USA2752275910.1109/PES.2005.1489390 (3) 1992; 7 (25) 1989; 4 (34) 2002; 8 (32) 2005; 20 (7) 2000; 15 (24) 1987; 2 (28) 1999; 14 (26) 1992; 7 (17) 1999; 14 BurnsR. M.GibsonC. A.Optimization of priority lists for a unit commitment programProceedings of IEEE/PES Summer MeetingJuly 1975San Francisco, Calif, USApaper A 75 453-1 (4) 1991; 6 (37) 1997; 12 (16) 2004; 19 (30) 2004; 19 (38) 2007; 1 BrookeA.KendrickD.MeerausA.RamanR.GAMS: a user's guideGAMS Development Corporation, 1998, http://www.gams.com (29) 2002; 17 (1) 1998; 13 (13) 1998; 13 SenjyuT.YamashiroH.UezatoK.FunabashiT.A unit commitment problem by using genetic algorithm based on unit characteristic classification1Proceedings of IEEE/PES Winter MeetingJanuary 2002Singapore586310.1109/PESW.2002.984954 RajanC. C. A.MohanM. R.ManivannanK.Refined simulated annealing method for solving unit commitment problem1Proceedings of the International Joint Conference on Neural Networks (IJCNN '02)May 2002Honolulu, Hawaii, USA33333810.1109/IJCNN.2002.1005493 (27) 1995; 10 (23) 1996; 11 (36) 2000; 147 (10) 1995; 142 (22) 1996; 37 RajanC. C. A.MohanM. R.ManivannanK.Neural based Tabu search method for solving unit commitment problemProceedings of the 5th International Conference on Power System Management and ControlApril 2002London, UK180185 (19) 2002; 17 MoriH.UsamiT.Unit commitment using Tabu search with restricted neighborhoodProceedings of the International Conference on Intelligent Systems Applications to Power Systems (ISAP '96)January-February 1996Orlando, Fla, USA422427 WoodA. J.WollenbergB. F.Power Generation Operation and Control19962ndNew York, NY, USAWiley-Interscience (18) 1998; 13 (20) 2001; 23 (11) 2000; 26 (9) 2005; 20 (6) 2002; 9 (33) 2002; 8 e_1_2_8_27_2 e_1_2_8_28_2 e_1_2_8_29_2 e_1_2_8_23_2 e_1_2_8_24_2 e_1_2_8_25_2 e_1_2_8_26_2 e_1_2_8_9_2 Chen C.-L. (e_1_2_8_6_2) 2002; 9 e_1_2_8_2_2 e_1_2_8_1_2 e_1_2_8_4_2 e_1_2_8_3_2 e_1_2_8_5_2 e_1_2_8_8_2 e_1_2_8_7_2 e_1_2_8_20_2 e_1_2_8_41_2 e_1_2_8_21_2 e_1_2_8_22_2 e_1_2_8_16_2 e_1_2_8_17_2 e_1_2_8_38_2 e_1_2_8_18_2 e_1_2_8_19_2 e_1_2_8_12_2 e_1_2_8_35_2 e_1_2_8_13_2 e_1_2_8_34_2 e_1_2_8_14_2 e_1_2_8_15_2 e_1_2_8_36_2 Wood A. J. (e_1_2_8_40_2) 1996 Bazaraa M. S. (e_1_2_8_39_2) 1993 Huang S.-J. (e_1_2_8_37_2) 1997; 12 e_1_2_8_31_2 e_1_2_8_30_2 e_1_2_8_10_2 e_1_2_8_33_2 e_1_2_8_11_2 e_1_2_8_32_2 |
| References_xml | – volume: 23 start-page: 827 issue: 8 year: 2001 end-page: 836 ident: 20 article-title: Unit commitment using hybrid models: a comparative study for dynamic programming, expert system, fuzzy system and genetic algorithms – volume: 8 start-page: 33 issue: 1 year: 2002 end-page: 42 ident: 33 article-title: Multiperiod hydrothermal economic dispatch by an interior point method – volume: 19 start-page: 577 issue: 1 year: 2004 end-page: 585 ident: 16 article-title: An evolutionary programming-based Tabu search method for solving the unit commitment problem – volume: 11 start-page: 83 issue: 1 year: 1996 end-page: 92 ident: 23 article-title: A genetic algorithm solution to the unit commitment problem – reference: RajanC. C. A.MohanM. R.ManivannanK.Refined simulated annealing method for solving unit commitment problem1Proceedings of the International Joint Conference on Neural Networks (IJCNN '02)May 2002Honolulu, Hawaii, USA33333810.1109/IJCNN.2002.1005493 – volume: 142 start-page: 595 issue: 6 year: 1995 end-page: 600 ident: 10 article-title: Unit commitment by parallel simulated annealing – volume: 13 start-page: 936 issue: 3 year: 1998 end-page: 945 ident: 18 article-title: A new thermal unit commitment approach using constraint logic programming – volume: 20 start-page: 2093 issue: 4 year: 2005 end-page: 2106 ident: 32 article-title: Long-term security-constrained unit commitment: hybrid Dantzig-Wolfe decomposition and subgradient approach – reference: GuanX.ZhaiQ.PapalexopoulosA.Optimization based methods for unit commitment: Lagrangian relaxation versus general mixed integer programming2Proceedings of IEEE/PES Summer MeetingJuly 2003Toronto, Canada1095110010.1109/PES.2003.1270468 – volume: 14 start-page: 1452 issue: 4 year: 1999 end-page: 1459 ident: 17 article-title: An evolutionary programming solution to the unit commitment problem – volume: 7 start-page: 982 issue: 3 year: 1992 end-page: 989 ident: 26 article-title: Daily generation scheduling optimization with transmission constraints: a new class of algorithms – volume: 13 start-page: 197 issue: 1 year: 1998 end-page: 204 ident: 1 article-title: A simulated annealing algorithm for unit commitment – volume: 147 start-page: 164 issue: 3 year: 2000 end-page: 170 ident: 36 article-title: Thermal generating unit commitment using an extended mean field annealing neural network – volume: 1 start-page: 548 issue: 4 year: 2007 end-page: 556 ident: 38 article-title: Improved merit order and augmented Lagrange Hopfield network for unit commitment – reference: RajanC. C. A.MohanM. R.ManivannanK.Neural based Tabu search method for solving unit commitment problemProceedings of the 5th International Conference on Power System Management and ControlApril 2002London, UK180185 – volume: 19 start-page: 620 issue: 1 year: 2004 end-page: 628 ident: 30 article-title: Unit commitment by enhanced adaptive Lagrangian relaxation – volume: 37 start-page: 55 issue: 1 year: 1996 end-page: 65 ident: 22 article-title: Solving the unit commitment problem with a genetic algorithm through a constraint satisfaction technique – reference: MoriH.UsamiT.Unit commitment using Tabu search with restricted neighborhoodProceedings of the International Conference on Intelligent Systems Applications to Power Systems (ISAP '96)January-February 1996Orlando, Fla, USA422427 – volume: 20 start-page: 2015 issue: 4 year: 2005 end-page: 2025 ident: 9 article-title: Price-based unit commitment: a case of Lagrangian relaxation versus mixed integer programming – volume: 12 start-page: 654 issue: 2 year: 1997 end-page: 660 ident: 37 article-title: Application of genetic-based neural networks to thermal unit commitment – volume: 2 start-page: 465 issue: 2 year: 1987 end-page: 473 ident: 24 article-title: Lagrangian reduction of search-range for large-scale unit commitment – volume: 15 start-page: 1098 issue: 3 year: 2000 end-page: 1104 ident: 7 article-title: Optimal response of a thermal unit to an electricity spot market – volume: 17 start-page: 87 issue: 1 year: 2002 end-page: 91 ident: 19 article-title: Unit commitment solution methodology using genetic algorithm – volume: 7 start-page: 591 issue: 2 year: 1992 end-page: 599 ident: 3 article-title: Multi-area unit commitment – reference: BrookeA.KendrickD.MeerausA.RamanR.GAMS: a user's guideGAMS Development Corporation, 1998, http://www.gams.com/ – volume: 8 start-page: 173 issue: 2 year: 2002 end-page: 195 ident: 34 article-title: A seeded memetic algorithm for large unit commitment problems – reference: WoodA. J.WollenbergB. F.Power Generation Operation and Control19962ndNew York, NY, USAWiley-Interscience – volume: 14 start-page: 89 issue: 1 year: 1999 end-page: 95 ident: 28 article-title: Short-term hydro-thermal coordination by Lagrangian relaxation: solution of the dual problem – reference: BurnsR. M.GibsonC. A.Optimization of priority lists for a unit commitment programProceedings of IEEE/PES Summer MeetingJuly 1975San Francisco, Calif, USApaper A 75 453-1 – volume: 7 start-page: 974 issue: 3 year: 1992 end-page: 981 ident: 35 article-title: A solution method of unit commitment by artificial neural networks – reference: VianaA.SousaJ. P.MatosM.Simulated annealing for the unit commitment problem2Proceedings of IEEE Porto Power Tech ConferenceSeptember 2001Porto, Portugal1410.1109/PTC.2001.964747 – reference: SenjyuT.YamashiroH.UezatoK.FunabashiT.A unit commitment problem by using genetic algorithm based on unit characteristic classification1Proceedings of IEEE/PES Winter MeetingJanuary 2002Singapore586310.1109/PESW.2002.984954 – volume: 17 start-page: 1250 issue: 4 year: 2002 end-page: 1257 ident: 29 article-title: Unit commitment with identical units: successive subproblem solving method based on Lagrangian relaxation – reference: BazaraaM. S.SheraliH. D.ShettyC. M.Nonlinear Programming: Theory and Algorithms19932ndHoboken, NJ, USAJohn Wiley & SonsMR2218478ZBL0774.90075 – volume: 9 start-page: 181 issue: 3 year: 2002 end-page: 189 ident: 6 article-title: Strategies to improve the dynamic programming for unit commitment application – volume: 26 start-page: 461 issue: 6 year: 2000 end-page: 477 ident: 11 article-title: Hybrid neural network and simulated annealing approach to the unit commitment problem – volume: 13 start-page: 197 issue: 1 year: 1998 end-page: 204 ident: 13 article-title: A simulated annealing algorithm for unit commitment – volume: 6 start-page: 691 issue: 2 year: 1991 end-page: 698 ident: 4 article-title: The application of commitment utilization factor (CUF) to thermal unit commitment – volume: 10 start-page: 1294 issue: 3 year: 1995 end-page: 1301 ident: 27 article-title: Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxation – reference: SriyanyongP.SongY. H.Unit commitment using particle swarm optimization combined with Lagrange relaxation3Proceedings of IEEE/PES General MeetingJune 2005San Francisco, Calif, USA2752275910.1109/PES.2005.1489390 – volume: 4 start-page: 1373 issue: 4 year: 1989 end-page: 1380 ident: 25 article-title: Implementation of a Lagrangian relaxation based unit commitment problem – ident: e_1_2_8_5_2 – ident: e_1_2_8_20_2 doi: 10.1016/S0142-0615(00)00090-9 – ident: e_1_2_8_13_2 doi: 10.1109/59.651636 – ident: e_1_2_8_34_2 doi: 10.1023/A:1017960507177 – ident: e_1_2_8_36_2 doi: 10.1049/ip-gtd:20000303 – ident: e_1_2_8_24_2 doi: 10.1109/TPWRS.1987.4335151 – volume-title: Nonlinear Programming: Theory and Algorithms year: 1993 ident: e_1_2_8_39_2 – ident: e_1_2_8_41_2 – ident: e_1_2_8_35_2 doi: 10.1109/59.207310 – ident: e_1_2_8_10_2 doi: 10.1049/ip-gtd:19952215 – ident: e_1_2_8_33_2 doi: 10.1080/10241230211378 – ident: e_1_2_8_17_2 doi: 10.1109/59.801925 – ident: e_1_2_8_15_2 – ident: e_1_2_8_38_2 doi: 10.1049/iet-gtd:20060321 – ident: e_1_2_8_31_2 doi: 10.1109/PES.2005.1489390 – ident: e_1_2_8_25_2 doi: 10.1109/59.41687 – ident: e_1_2_8_2_2 doi: 10.1109/PTC.2001.964747 – ident: e_1_2_8_4_2 doi: 10.1109/59.76714 – ident: e_1_2_8_22_2 doi: 10.1016/0378-7796(96)01036-X – ident: e_1_2_8_28_2 doi: 10.1109/59.744490 – volume-title: Power Generation Operation and Control year: 1996 ident: e_1_2_8_40_2 – ident: e_1_2_8_21_2 doi: 10.1109/PESW.2002.984954 – ident: e_1_2_8_19_2 doi: 10.1109/59.982197 – ident: e_1_2_8_23_2 doi: 10.1109/59.485989 – ident: e_1_2_8_7_2 doi: 10.1109/59.871739 – ident: e_1_2_8_30_2 doi: 10.1109/TPWRS.2003.820707 – ident: e_1_2_8_29_2 doi: 10.1109/TPWRS.2002.805003 – ident: e_1_2_8_18_2 doi: 10.1109/59.708832 – ident: e_1_2_8_11_2 doi: 10.1016/S0045-7906(99)00037-3 – ident: e_1_2_8_8_2 doi: 10.1109/PES.2003.1270468 – ident: e_1_2_8_14_2 – ident: e_1_2_8_16_2 doi: 10.1109/TPWRS.2003.821472 – volume: 9 start-page: 181 year: 2002 ident: e_1_2_8_6_2 article-title: Strategies to improve the dynamic programming for unit commitment application publication-title: Transactions of the Chinese Institute of Engineers – ident: e_1_2_8_26_2 doi: 10.1109/59.207311 – ident: e_1_2_8_32_2 doi: 10.1109/TPWRS.2005.857286 – ident: e_1_2_8_9_2 doi: 10.1109/TPWRS.2005.857391 – volume: 12 start-page: 654 year: 1997 ident: e_1_2_8_37_2 article-title: Application of genetic-based neural networks to thermal unit commitment publication-title: IEEE Transactions on Power Systems doi: 10.1109/59.589634 – ident: e_1_2_8_3_2 doi: 10.1109/59.141764 – ident: e_1_2_8_1_2 doi: 10.1109/59.651636 – ident: e_1_2_8_12_2 doi: 10.1109/IJCNN.2002.1005493 – ident: e_1_2_8_27_2 doi: 10.1109/59.466524 |
| SSID | ssj0021518 |
| Score | 1.8165659 |
| Snippet | The unit commitment (UC) problem which is an important subject in power system engineering is solved by using Lagragian relaxation (LR), penalty function (PF),... |
| SourceID | unpaywall crossref hindawi airiti |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 1053 |
| SummonAdditionalLinks | – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3da9swEBdbylj3sO6rLPtCsO5loCSyvqzH0K2UQkpgDWTswUiyxcKyJCwOpfvrd2crWTtGGXuxLXwIWSfrfiedfkfIEVcuj1pGpoIXTJaZZd5px7i3XvmYO6Pw7PDoXJ9O5NlUTVNUJZ6FKZEifunKde8r-qSXs2a2Tv267gOU7ON6fl_oHKxLb1XGu2RPK8DhHbI3OR8PPzfbmxmS8Ylp-6yZGTQpGMFXEQwQgkkH9cCWXq8NjJCbIZXQDRt1LzXkAbm_Wazc1aWbz6-ZoJMD8mXb-Dby5FtvU_te-PkHr-P_fd0j8jAhUzpsh9JjcqdaPCEHCaXSNAesn5IwpMe_KcMpBiJe0WWkFzAqKvohJVyp6WhHCAu1jppE1WsKEJl-Ws5xFYPCa4qQF6v7Pmui3em4zW_zjExOPl4cn7KUqoE5YWzNSmEAaHErwdfmwaroDUCz4K3KK2syGaLkleTRaBu5Bi9G2iBQ0nKpwJ8Xh6SzWC6q54RW1jsTOPelNrIcGKszGzyHqWKQ20raLjlrtVRs-60YZwhcMYfOIMO8mpbjDYoCt9UzfbMAiFLARatCZ13yfqvpIiRSdMzNMS8a50ipprqi1UeXHO2EVy0XyN_F3ibt3i71bjecbpN78Y9yL8l-u9GFq0OvSKf-saleA16q_Zv0Y_wCaSAGTg priority: 102 providerName: Unpaywall |
| Title | A Comparative Study of Three Different Mathematical Methods for Solving the Unit Commitment Problem |
| URI | https://www.airitilibrary.com/Article/Detail/P20161117002-200912-201703270026-201703270026-1053-1065-62 https://dx.doi.org/10.1155/2009/368024 https://downloads.hindawi.com/journals/mpe/2009/368024.pdf |
| UnpaywallVersion | publishedVersion |
| Volume | 2009 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 1563-5147 dateEnd: 20240530 omitProxy: true ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: KQ8 dateStart: 19950101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVPQU databaseName: Middle East & Africa Database customDbUrl: eissn: 1563-5147 dateEnd: 20250131 omitProxy: false ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: CWDGH dateStart: 20080101 isFulltext: true titleUrlDefault: https://search.proquest.com/middleeastafrica providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1563-5147 dateEnd: 20250131 omitProxy: true ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: BENPR dateStart: 20080101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 1563-5147 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: 8FG dateStart: 20080101 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest – providerCode: PRVWIB databaseName: Openly Available Collection - Wiley Online Library Open Access customDbUrl: eissn: 1563-5147 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0021518 issn: 1024-123X databaseCode: 24P dateStart: 19950101 isFulltext: true titleUrlDefault: https://authorservices.wiley.com/open-science/open-access/browse-journals.html providerName: Wiley-Blackwell |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3dSxtBEB-MIvalamtpqoYF7YtwmL39un0MfhCUSNoaSJ-O3c0dCmkiJiL-987crVFrkb7csXdz83Czy_xmZ3Z-APtcuazUskxU8CKRo9Qm3mmXcG-98mXmjKKzw70L3R3Is6EaxgLZ2dsUPnq7Q9q_PxQ6Q2_SgEamqXDrZ3e4CKvQZ9UH3lLqwCeG8RTeX5-ih3HX1CfolQNavaLI9x4frt1NbtzDvRuPX_iX0w34GIEh69SW3ISlYvIJ1iNIZHEJzj5D6LCj547djOoAH9i0ZJdolIIdR76TOest-rGi1l7FEz1jiFDZr-mYNhEYvmaEOEndn-uq2Jz1a3qZLRicnlwedZPIlJA4Yew8GQmDOIdbiaEuD1aV3iAyCt6qrLAmlaGUvJC8NNqWXGMQIW0QJGm5VBhOiy-wPJlOiq_ACuudCZz7kTZy1DZWpzZ4jiu1ndlC2iac1f8xj5N9lvdTwo1EYdNOidbScrrhUFBWO9WvBwjoBF60ynXahIMnW-Qh9iQnaoxxXsUmSlXq8tqCTdhfCN_UrTj-LbYXjfq-1PeFwd-T-_Zf2rbhQ51loq2ZHVie394VuwhW5r4FjfMfWauasS1YGVz0O78fAfRR2y4 |
| linkProvider | Hindawi Publishing |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3da9swEBdbylj3sO6rLPtCsO5loCSyvqzH0K2UQkpgDWTswUiyxcKyJCwOpfvrd2crWTtGGXuxLXwIWSfrfiedfkfIEVcuj1pGpoIXTJaZZd5px7i3XvmYO6Pw7PDoXJ9O5NlUTVNUJZ6FKZEifunKde8r-qSXs2a2Tv267gOU7ON6fl_oHKxLb1XGu2RPK8DhHbI3OR8PPzfbmxmS8Ylp-6yZGTQpGMFXEQwQgkkH9cCWXq8NjJCbIZXQDRt1LzXkAbm_Wazc1aWbz6-ZoJMD8mXb-Dby5FtvU_te-PkHr-P_fd0j8jAhUzpsh9JjcqdaPCEHCaXSNAesn5IwpMe_KcMpBiJe0WWkFzAqKvohJVyp6WhHCAu1jppE1WsKEJl-Ws5xFYPCa4qQF6v7Pmui3em4zW_zjExOPl4cn7KUqoE5YWzNSmEAaHErwdfmwaroDUCz4K3KK2syGaLkleTRaBu5Bi9G2iBQ0nKpwJ8Xh6SzWC6q54RW1jsTOPelNrIcGKszGzyHqWKQ20raLjlrtVRs-60YZwhcMYfOIMO8mpbjDYoCt9UzfbMAiFLARatCZ13yfqvpIiRSdMzNMS8a50ipprqi1UeXHO2EVy0XyN_F3ibt3i71bjecbpN78Y9yL8l-u9GFq0OvSKf-saleA16q_Zv0Y_wCaSAGTg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Comparative+Study+of+Three+Different+Mathematical+Methods+for+Solving+the+Unit+Commitment+Problem&rft.jtitle=Mathematical+Problems+in+Engineering&rft.au=Mehmet+Kurban&rft.au=%C3%9Cmm%C3%BChan+Ba%C5%9Faran+Filik&rft.date=2009-01-01&rft.pub=Hindawi+Limiteds&rft.issn=1024-123X&rft.volume=2009&rft.spage=1053&rft.epage=1065-62&rft_id=info:doi/10.1155%2F2009%2F368024&rft.externalDocID=P20161117002_200912_201703270026_201703270026_1053_1065_62 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fwww.airitilibrary.com%2Fjnltitledo%2FP20161117002-c.jpg |