Convex optimization of virtual storage system scheduling in market environment
Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (cons...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
HOU, Peng [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2019 |
|---|
| Schlagwörter: |
Virtual energy storage system (VESS) |
|---|
| Anmerkung: |
© The Author(s) 2019 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of modern power systems and clean energy - Nanjing : NARI, 2013, 7(2019), 6 vom: 25. Juli, Seite 1744-1748 |
|---|---|
| Übergeordnetes Werk: |
volume:7 ; year:2019 ; number:6 ; day:25 ; month:07 ; pages:1744-1748 |
| Links: |
|---|
| DOI / URN: |
10.1007/s40565-019-0548-z |
|---|
| Katalog-ID: |
SPR036674443 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR036674443 | ||
| 003 | DE-627 | ||
| 005 | 20230328191558.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201007s2019 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s40565-019-0548-z |2 doi | |
| 035 | |a (DE-627)SPR036674443 | ||
| 035 | |a (SPR)s40565-019-0548-z-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a HOU, Peng |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Convex optimization of virtual storage system scheduling in market environment |
| 264 | 1 | |c 2019 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a © The Author(s) 2019 | ||
| 520 | |a Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (consumer) and discharging (producer) modes. It is possible to provide ancillary services via VESS by exploiting the flexibility and thus much research has been proposed on the optimization of the VESS scheduling. In general, the charging and discharging efficiencies of VESS are different and there can be only one status at a time slot. To achieve the optimal schedule while considering the constraints above, binary terms should be introduced into the optimization problem which end up with a nonconvex problem. In this paper, a complimentary mathematical proof is given for the convexification of this mixed integer linear programming (MILP) problem so that the linear programming (LP) method can be applied instead if the objective function is linear. The proposed proof is validated through a case study and the simulation results show the effectiveness of the proposed method. | ||
| 650 | 4 | |a Virtual energy storage system (VESS) |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Convexification |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Mixed integer linear programming (MILP) |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Complimentary mathematical proof |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a HU, Junjie |0 (orcid)0000-0002-8483-5501 |4 aut | |
| 700 | 1 | |a YANG, Guangya |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of modern power systems and clean energy |d Nanjing : NARI, 2013 |g 7(2019), 6 vom: 25. Juli, Seite 1744-1748 |w (DE-627)75682821X |w (DE-600)2727912-1 |x 2196-5420 |7 nnns |
| 773 | 1 | 8 | |g volume:7 |g year:2019 |g number:6 |g day:25 |g month:07 |g pages:1744-1748 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s40565-019-0548-z |z kostenfrei |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 912 | |a GBV_ILN_11 | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_23 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_31 | ||
| 912 | |a GBV_ILN_39 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_60 | ||
| 912 | |a GBV_ILN_62 | ||
| 912 | |a GBV_ILN_63 | ||
| 912 | |a GBV_ILN_65 | ||
| 912 | |a GBV_ILN_69 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_73 | ||
| 912 | |a GBV_ILN_95 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_110 | ||
| 912 | |a GBV_ILN_151 | ||
| 912 | |a GBV_ILN_161 | ||
| 912 | |a GBV_ILN_170 | ||
| 912 | |a GBV_ILN_213 | ||
| 912 | |a GBV_ILN_230 | ||
| 912 | |a GBV_ILN_285 | ||
| 912 | |a GBV_ILN_293 | ||
| 912 | |a GBV_ILN_370 | ||
| 912 | |a GBV_ILN_602 | ||
| 912 | |a GBV_ILN_2014 | ||
| 912 | |a GBV_ILN_4012 | ||
| 912 | |a GBV_ILN_4037 | ||
| 912 | |a GBV_ILN_4112 | ||
| 912 | |a GBV_ILN_4125 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4249 | ||
| 912 | |a GBV_ILN_4305 | ||
| 912 | |a GBV_ILN_4306 | ||
| 912 | |a GBV_ILN_4307 | ||
| 912 | |a GBV_ILN_4313 | ||
| 912 | |a GBV_ILN_4322 | ||
| 912 | |a GBV_ILN_4323 | ||
| 912 | |a GBV_ILN_4324 | ||
| 912 | |a GBV_ILN_4325 | ||
| 912 | |a GBV_ILN_4335 | ||
| 912 | |a GBV_ILN_4338 | ||
| 912 | |a GBV_ILN_4367 | ||
| 912 | |a GBV_ILN_4700 | ||
| 951 | |a AR | ||
| 952 | |d 7 |j 2019 |e 6 |b 25 |c 07 |h 1744-1748 | ||
| author_variant |
p h ph j h jh g y gy |
|---|---|
| matchkey_str |
article:21965420:2019----::ovxpiiainfitasoaeytmceuig |
| hierarchy_sort_str |
2019 |
| publishDate |
2019 |
| allfields |
10.1007/s40565-019-0548-z doi (DE-627)SPR036674443 (SPR)s40565-019-0548-z-e DE-627 ger DE-627 rakwb eng HOU, Peng verfasserin aut Convex optimization of virtual storage system scheduling in market environment 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2019 Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (consumer) and discharging (producer) modes. It is possible to provide ancillary services via VESS by exploiting the flexibility and thus much research has been proposed on the optimization of the VESS scheduling. In general, the charging and discharging efficiencies of VESS are different and there can be only one status at a time slot. To achieve the optimal schedule while considering the constraints above, binary terms should be introduced into the optimization problem which end up with a nonconvex problem. In this paper, a complimentary mathematical proof is given for the convexification of this mixed integer linear programming (MILP) problem so that the linear programming (LP) method can be applied instead if the objective function is linear. The proposed proof is validated through a case study and the simulation results show the effectiveness of the proposed method. Virtual energy storage system (VESS) (dpeaa)DE-He213 Convexification (dpeaa)DE-He213 Mixed integer linear programming (MILP) (dpeaa)DE-He213 Complimentary mathematical proof (dpeaa)DE-He213 HU, Junjie (orcid)0000-0002-8483-5501 aut YANG, Guangya aut Enthalten in Journal of modern power systems and clean energy Nanjing : NARI, 2013 7(2019), 6 vom: 25. Juli, Seite 1744-1748 (DE-627)75682821X (DE-600)2727912-1 2196-5420 nnns volume:7 year:2019 number:6 day:25 month:07 pages:1744-1748 https://dx.doi.org/10.1007/s40565-019-0548-z kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 7 2019 6 25 07 1744-1748 |
| spelling |
10.1007/s40565-019-0548-z doi (DE-627)SPR036674443 (SPR)s40565-019-0548-z-e DE-627 ger DE-627 rakwb eng HOU, Peng verfasserin aut Convex optimization of virtual storage system scheduling in market environment 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2019 Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (consumer) and discharging (producer) modes. It is possible to provide ancillary services via VESS by exploiting the flexibility and thus much research has been proposed on the optimization of the VESS scheduling. In general, the charging and discharging efficiencies of VESS are different and there can be only one status at a time slot. To achieve the optimal schedule while considering the constraints above, binary terms should be introduced into the optimization problem which end up with a nonconvex problem. In this paper, a complimentary mathematical proof is given for the convexification of this mixed integer linear programming (MILP) problem so that the linear programming (LP) method can be applied instead if the objective function is linear. The proposed proof is validated through a case study and the simulation results show the effectiveness of the proposed method. Virtual energy storage system (VESS) (dpeaa)DE-He213 Convexification (dpeaa)DE-He213 Mixed integer linear programming (MILP) (dpeaa)DE-He213 Complimentary mathematical proof (dpeaa)DE-He213 HU, Junjie (orcid)0000-0002-8483-5501 aut YANG, Guangya aut Enthalten in Journal of modern power systems and clean energy Nanjing : NARI, 2013 7(2019), 6 vom: 25. Juli, Seite 1744-1748 (DE-627)75682821X (DE-600)2727912-1 2196-5420 nnns volume:7 year:2019 number:6 day:25 month:07 pages:1744-1748 https://dx.doi.org/10.1007/s40565-019-0548-z kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 7 2019 6 25 07 1744-1748 |
| allfields_unstemmed |
10.1007/s40565-019-0548-z doi (DE-627)SPR036674443 (SPR)s40565-019-0548-z-e DE-627 ger DE-627 rakwb eng HOU, Peng verfasserin aut Convex optimization of virtual storage system scheduling in market environment 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2019 Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (consumer) and discharging (producer) modes. It is possible to provide ancillary services via VESS by exploiting the flexibility and thus much research has been proposed on the optimization of the VESS scheduling. In general, the charging and discharging efficiencies of VESS are different and there can be only one status at a time slot. To achieve the optimal schedule while considering the constraints above, binary terms should be introduced into the optimization problem which end up with a nonconvex problem. In this paper, a complimentary mathematical proof is given for the convexification of this mixed integer linear programming (MILP) problem so that the linear programming (LP) method can be applied instead if the objective function is linear. The proposed proof is validated through a case study and the simulation results show the effectiveness of the proposed method. Virtual energy storage system (VESS) (dpeaa)DE-He213 Convexification (dpeaa)DE-He213 Mixed integer linear programming (MILP) (dpeaa)DE-He213 Complimentary mathematical proof (dpeaa)DE-He213 HU, Junjie (orcid)0000-0002-8483-5501 aut YANG, Guangya aut Enthalten in Journal of modern power systems and clean energy Nanjing : NARI, 2013 7(2019), 6 vom: 25. Juli, Seite 1744-1748 (DE-627)75682821X (DE-600)2727912-1 2196-5420 nnns volume:7 year:2019 number:6 day:25 month:07 pages:1744-1748 https://dx.doi.org/10.1007/s40565-019-0548-z kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 7 2019 6 25 07 1744-1748 |
| allfieldsGer |
10.1007/s40565-019-0548-z doi (DE-627)SPR036674443 (SPR)s40565-019-0548-z-e DE-627 ger DE-627 rakwb eng HOU, Peng verfasserin aut Convex optimization of virtual storage system scheduling in market environment 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2019 Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (consumer) and discharging (producer) modes. It is possible to provide ancillary services via VESS by exploiting the flexibility and thus much research has been proposed on the optimization of the VESS scheduling. In general, the charging and discharging efficiencies of VESS are different and there can be only one status at a time slot. To achieve the optimal schedule while considering the constraints above, binary terms should be introduced into the optimization problem which end up with a nonconvex problem. In this paper, a complimentary mathematical proof is given for the convexification of this mixed integer linear programming (MILP) problem so that the linear programming (LP) method can be applied instead if the objective function is linear. The proposed proof is validated through a case study and the simulation results show the effectiveness of the proposed method. Virtual energy storage system (VESS) (dpeaa)DE-He213 Convexification (dpeaa)DE-He213 Mixed integer linear programming (MILP) (dpeaa)DE-He213 Complimentary mathematical proof (dpeaa)DE-He213 HU, Junjie (orcid)0000-0002-8483-5501 aut YANG, Guangya aut Enthalten in Journal of modern power systems and clean energy Nanjing : NARI, 2013 7(2019), 6 vom: 25. Juli, Seite 1744-1748 (DE-627)75682821X (DE-600)2727912-1 2196-5420 nnns volume:7 year:2019 number:6 day:25 month:07 pages:1744-1748 https://dx.doi.org/10.1007/s40565-019-0548-z kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 7 2019 6 25 07 1744-1748 |
| allfieldsSound |
10.1007/s40565-019-0548-z doi (DE-627)SPR036674443 (SPR)s40565-019-0548-z-e DE-627 ger DE-627 rakwb eng HOU, Peng verfasserin aut Convex optimization of virtual storage system scheduling in market environment 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2019 Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (consumer) and discharging (producer) modes. It is possible to provide ancillary services via VESS by exploiting the flexibility and thus much research has been proposed on the optimization of the VESS scheduling. In general, the charging and discharging efficiencies of VESS are different and there can be only one status at a time slot. To achieve the optimal schedule while considering the constraints above, binary terms should be introduced into the optimization problem which end up with a nonconvex problem. In this paper, a complimentary mathematical proof is given for the convexification of this mixed integer linear programming (MILP) problem so that the linear programming (LP) method can be applied instead if the objective function is linear. The proposed proof is validated through a case study and the simulation results show the effectiveness of the proposed method. Virtual energy storage system (VESS) (dpeaa)DE-He213 Convexification (dpeaa)DE-He213 Mixed integer linear programming (MILP) (dpeaa)DE-He213 Complimentary mathematical proof (dpeaa)DE-He213 HU, Junjie (orcid)0000-0002-8483-5501 aut YANG, Guangya aut Enthalten in Journal of modern power systems and clean energy Nanjing : NARI, 2013 7(2019), 6 vom: 25. Juli, Seite 1744-1748 (DE-627)75682821X (DE-600)2727912-1 2196-5420 nnns volume:7 year:2019 number:6 day:25 month:07 pages:1744-1748 https://dx.doi.org/10.1007/s40565-019-0548-z kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 7 2019 6 25 07 1744-1748 |
| language |
English |
| source |
Enthalten in Journal of modern power systems and clean energy 7(2019), 6 vom: 25. Juli, Seite 1744-1748 volume:7 year:2019 number:6 day:25 month:07 pages:1744-1748 |
| sourceStr |
Enthalten in Journal of modern power systems and clean energy 7(2019), 6 vom: 25. Juli, Seite 1744-1748 volume:7 year:2019 number:6 day:25 month:07 pages:1744-1748 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Virtual energy storage system (VESS) Convexification Mixed integer linear programming (MILP) Complimentary mathematical proof |
| isfreeaccess_bool |
true |
| container_title |
Journal of modern power systems and clean energy |
| authorswithroles_txt_mv |
HOU, Peng @@aut@@ HU, Junjie @@aut@@ YANG, Guangya @@aut@@ |
| publishDateDaySort_date |
2019-07-25T00:00:00Z |
| hierarchy_top_id |
75682821X |
| id |
SPR036674443 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR036674443</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230328191558.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s40565-019-0548-z</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR036674443</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s40565-019-0548-z-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">HOU, Peng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Convex optimization of virtual storage system scheduling in market environment</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (consumer) and discharging (producer) modes. It is possible to provide ancillary services via VESS by exploiting the flexibility and thus much research has been proposed on the optimization of the VESS scheduling. In general, the charging and discharging efficiencies of VESS are different and there can be only one status at a time slot. To achieve the optimal schedule while considering the constraints above, binary terms should be introduced into the optimization problem which end up with a nonconvex problem. In this paper, a complimentary mathematical proof is given for the convexification of this mixed integer linear programming (MILP) problem so that the linear programming (LP) method can be applied instead if the objective function is linear. The proposed proof is validated through a case study and the simulation results show the effectiveness of the proposed method.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Virtual energy storage system (VESS)</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Convexification</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mixed integer linear programming (MILP)</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complimentary mathematical proof</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">HU, Junjie</subfield><subfield code="0">(orcid)0000-0002-8483-5501</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">YANG, Guangya</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of modern power systems and clean energy</subfield><subfield code="d">Nanjing : NARI, 2013</subfield><subfield code="g">7(2019), 6 vom: 25. Juli, Seite 1744-1748</subfield><subfield code="w">(DE-627)75682821X</subfield><subfield code="w">(DE-600)2727912-1</subfield><subfield code="x">2196-5420</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:6</subfield><subfield code="g">day:25</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:1744-1748</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s40565-019-0548-z</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">2019</subfield><subfield code="e">6</subfield><subfield code="b">25</subfield><subfield code="c">07</subfield><subfield code="h">1744-1748</subfield></datafield></record></collection>
|
| author |
HOU, Peng |
| spellingShingle |
HOU, Peng misc Virtual energy storage system (VESS) misc Convexification misc Mixed integer linear programming (MILP) misc Complimentary mathematical proof Convex optimization of virtual storage system scheduling in market environment |
| authorStr |
HOU, Peng |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)75682821X |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
2196-5420 |
| topic_title |
Convex optimization of virtual storage system scheduling in market environment Virtual energy storage system (VESS) (dpeaa)DE-He213 Convexification (dpeaa)DE-He213 Mixed integer linear programming (MILP) (dpeaa)DE-He213 Complimentary mathematical proof (dpeaa)DE-He213 |
| topic |
misc Virtual energy storage system (VESS) misc Convexification misc Mixed integer linear programming (MILP) misc Complimentary mathematical proof |
| topic_unstemmed |
misc Virtual energy storage system (VESS) misc Convexification misc Mixed integer linear programming (MILP) misc Complimentary mathematical proof |
| topic_browse |
misc Virtual energy storage system (VESS) misc Convexification misc Mixed integer linear programming (MILP) misc Complimentary mathematical proof |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
Journal of modern power systems and clean energy |
| hierarchy_parent_id |
75682821X |
| hierarchy_top_title |
Journal of modern power systems and clean energy |
| isfreeaccess_txt |
true |
| familylinks_str_mv |
(DE-627)75682821X (DE-600)2727912-1 |
| title |
Convex optimization of virtual storage system scheduling in market environment |
| ctrlnum |
(DE-627)SPR036674443 (SPR)s40565-019-0548-z-e |
| title_full |
Convex optimization of virtual storage system scheduling in market environment |
| author_sort |
HOU, Peng |
| journal |
Journal of modern power systems and clean energy |
| journalStr |
Journal of modern power systems and clean energy |
| lang_code |
eng |
| isOA_bool |
true |
| recordtype |
marc |
| publishDateSort |
2019 |
| contenttype_str_mv |
txt |
| container_start_page |
1744 |
| author_browse |
HOU, Peng HU, Junjie YANG, Guangya |
| container_volume |
7 |
| format_se |
Elektronische Aufsätze |
| author-letter |
HOU, Peng |
| doi_str_mv |
10.1007/s40565-019-0548-z |
| normlink |
(ORCID)0000-0002-8483-5501 |
| normlink_prefix_str_mv |
(orcid)0000-0002-8483-5501 |
| title_sort |
convex optimization of virtual storage system scheduling in market environment |
| title_auth |
Convex optimization of virtual storage system scheduling in market environment |
| abstract |
Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (consumer) and discharging (producer) modes. It is possible to provide ancillary services via VESS by exploiting the flexibility and thus much research has been proposed on the optimization of the VESS scheduling. In general, the charging and discharging efficiencies of VESS are different and there can be only one status at a time slot. To achieve the optimal schedule while considering the constraints above, binary terms should be introduced into the optimization problem which end up with a nonconvex problem. In this paper, a complimentary mathematical proof is given for the convexification of this mixed integer linear programming (MILP) problem so that the linear programming (LP) method can be applied instead if the objective function is linear. The proposed proof is validated through a case study and the simulation results show the effectiveness of the proposed method. © The Author(s) 2019 |
| abstractGer |
Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (consumer) and discharging (producer) modes. It is possible to provide ancillary services via VESS by exploiting the flexibility and thus much research has been proposed on the optimization of the VESS scheduling. In general, the charging and discharging efficiencies of VESS are different and there can be only one status at a time slot. To achieve the optimal schedule while considering the constraints above, binary terms should be introduced into the optimization problem which end up with a nonconvex problem. In this paper, a complimentary mathematical proof is given for the convexification of this mixed integer linear programming (MILP) problem so that the linear programming (LP) method can be applied instead if the objective function is linear. The proposed proof is validated through a case study and the simulation results show the effectiveness of the proposed method. © The Author(s) 2019 |
| abstract_unstemmed |
Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (consumer) and discharging (producer) modes. It is possible to provide ancillary services via VESS by exploiting the flexibility and thus much research has been proposed on the optimization of the VESS scheduling. In general, the charging and discharging efficiencies of VESS are different and there can be only one status at a time slot. To achieve the optimal schedule while considering the constraints above, binary terms should be introduced into the optimization problem which end up with a nonconvex problem. In this paper, a complimentary mathematical proof is given for the convexification of this mixed integer linear programming (MILP) problem so that the linear programming (LP) method can be applied instead if the objective function is linear. The proposed proof is validated through a case study and the simulation results show the effectiveness of the proposed method. © The Author(s) 2019 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 |
| container_issue |
6 |
| title_short |
Convex optimization of virtual storage system scheduling in market environment |
| url |
https://dx.doi.org/10.1007/s40565-019-0548-z |
| remote_bool |
true |
| author2 |
HU, Junjie YANG, Guangya |
| author2Str |
HU, Junjie YANG, Guangya |
| ppnlink |
75682821X |
| mediatype_str_mv |
c |
| isOA_txt |
true |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s40565-019-0548-z |
| up_date |
2024-07-03T19:01:32.398Z |
| _version_ |
1803585629613719552 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR036674443</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230328191558.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s40565-019-0548-z</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR036674443</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s40565-019-0548-z-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">HOU, Peng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Convex optimization of virtual storage system scheduling in market environment</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Due to the popularization of distributed energy resources (DERs), the aggregated prosumer effect excels a general energy storage system characteristic. Virtual energy storage system (VESS) concept is proposed hereby that mimics an actual storage unit and incorporates the same charging (consumer) and discharging (producer) modes. It is possible to provide ancillary services via VESS by exploiting the flexibility and thus much research has been proposed on the optimization of the VESS scheduling. In general, the charging and discharging efficiencies of VESS are different and there can be only one status at a time slot. To achieve the optimal schedule while considering the constraints above, binary terms should be introduced into the optimization problem which end up with a nonconvex problem. In this paper, a complimentary mathematical proof is given for the convexification of this mixed integer linear programming (MILP) problem so that the linear programming (LP) method can be applied instead if the objective function is linear. The proposed proof is validated through a case study and the simulation results show the effectiveness of the proposed method.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Virtual energy storage system (VESS)</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Convexification</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mixed integer linear programming (MILP)</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complimentary mathematical proof</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">HU, Junjie</subfield><subfield code="0">(orcid)0000-0002-8483-5501</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">YANG, Guangya</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of modern power systems and clean energy</subfield><subfield code="d">Nanjing : NARI, 2013</subfield><subfield code="g">7(2019), 6 vom: 25. Juli, Seite 1744-1748</subfield><subfield code="w">(DE-627)75682821X</subfield><subfield code="w">(DE-600)2727912-1</subfield><subfield code="x">2196-5420</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:6</subfield><subfield code="g">day:25</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:1744-1748</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s40565-019-0548-z</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">2019</subfield><subfield code="e">6</subfield><subfield code="b">25</subfield><subfield code="c">07</subfield><subfield code="h">1744-1748</subfield></datafield></record></collection>
|
| score |
7.4004374 |