Online Distribution Network Scheduling via Provably Robust Learning Approach
Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this...
Ausführliche Beschreibung
Autor*in: |
Naixiao Wang [verfasserIn] Xinlei Cai [verfasserIn] Linwei Sang [verfasserIn] Tingxiang Zhang [verfasserIn] Zhongkai Yi [verfasserIn] Ying Xu [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2024 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
In: Energies - MDPI AG, 2008, 17(2024), 6, p 1361 |
---|---|
Übergeordnetes Werk: |
volume:17 ; year:2024 ; number:6, p 1361 |
Links: |
---|
DOI / URN: |
10.3390/en17061361 |
---|
Katalog-ID: |
DOAJ10051894X |
---|
LEADER | 01000naa a22002652 4500 | ||
---|---|---|---|
001 | DOAJ10051894X | ||
003 | DE-627 | ||
005 | 20240414100314.0 | ||
007 | cr uuu---uuuuu | ||
008 | 240414s2024 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.3390/en17061361 |2 doi | |
035 | |a (DE-627)DOAJ10051894X | ||
035 | |a (DE-599)DOAJfa3417c9c596413a807f89b4da51c197 | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
100 | 0 | |a Naixiao Wang |e verfasserin |4 aut | |
245 | 1 | 0 | |a Online Distribution Network Scheduling via Provably Robust Learning Approach |
264 | 1 | |c 2024 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS. | ||
650 | 4 | |a distribution network scheduling | |
650 | 4 | |a learn-to-optimize | |
650 | 4 | |a online scheduling | |
650 | 4 | |a machine learning | |
653 | 0 | |a Technology | |
653 | 0 | |a T | |
700 | 0 | |a Xinlei Cai |e verfasserin |4 aut | |
700 | 0 | |a Linwei Sang |e verfasserin |4 aut | |
700 | 0 | |a Tingxiang Zhang |e verfasserin |4 aut | |
700 | 0 | |a Zhongkai Yi |e verfasserin |4 aut | |
700 | 0 | |a Ying Xu |e verfasserin |4 aut | |
773 | 0 | 8 | |i In |t Energies |d MDPI AG, 2008 |g 17(2024), 6, p 1361 |w (DE-627)572083742 |w (DE-600)2437446-5 |x 19961073 |7 nnns |
773 | 1 | 8 | |g volume:17 |g year:2024 |g number:6, p 1361 |
856 | 4 | 0 | |u https://doi.org/10.3390/en17061361 |z kostenfrei |
856 | 4 | 0 | |u https://doaj.org/article/fa3417c9c596413a807f89b4da51c197 |z kostenfrei |
856 | 4 | 0 | |u https://www.mdpi.com/1996-1073/17/6/1361 |z kostenfrei |
856 | 4 | 2 | |u https://doaj.org/toc/1996-1073 |y Journal toc |z kostenfrei |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_DOAJ | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
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_206 | ||
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_2005 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2055 | ||
912 | |a GBV_ILN_2108 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2119 | ||
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 17 |j 2024 |e 6, p 1361 |
author_variant |
n w nw x c xc l s ls t z tz z y zy y x yx |
---|---|
matchkey_str |
article:19961073:2024----::nieitiuinewrshdlnvarvbyou |
hierarchy_sort_str |
2024 |
publishDate |
2024 |
allfields |
10.3390/en17061361 doi (DE-627)DOAJ10051894X (DE-599)DOAJfa3417c9c596413a807f89b4da51c197 DE-627 ger DE-627 rakwb eng Naixiao Wang verfasserin aut Online Distribution Network Scheduling via Provably Robust Learning Approach 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS. distribution network scheduling learn-to-optimize online scheduling machine learning Technology T Xinlei Cai verfasserin aut Linwei Sang verfasserin aut Tingxiang Zhang verfasserin aut Zhongkai Yi verfasserin aut Ying Xu verfasserin aut In Energies MDPI AG, 2008 17(2024), 6, p 1361 (DE-627)572083742 (DE-600)2437446-5 19961073 nnns volume:17 year:2024 number:6, p 1361 https://doi.org/10.3390/en17061361 kostenfrei https://doaj.org/article/fa3417c9c596413a807f89b4da51c197 kostenfrei https://www.mdpi.com/1996-1073/17/6/1361 kostenfrei https://doaj.org/toc/1996-1073 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2119 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 17 2024 6, p 1361 |
spelling |
10.3390/en17061361 doi (DE-627)DOAJ10051894X (DE-599)DOAJfa3417c9c596413a807f89b4da51c197 DE-627 ger DE-627 rakwb eng Naixiao Wang verfasserin aut Online Distribution Network Scheduling via Provably Robust Learning Approach 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS. distribution network scheduling learn-to-optimize online scheduling machine learning Technology T Xinlei Cai verfasserin aut Linwei Sang verfasserin aut Tingxiang Zhang verfasserin aut Zhongkai Yi verfasserin aut Ying Xu verfasserin aut In Energies MDPI AG, 2008 17(2024), 6, p 1361 (DE-627)572083742 (DE-600)2437446-5 19961073 nnns volume:17 year:2024 number:6, p 1361 https://doi.org/10.3390/en17061361 kostenfrei https://doaj.org/article/fa3417c9c596413a807f89b4da51c197 kostenfrei https://www.mdpi.com/1996-1073/17/6/1361 kostenfrei https://doaj.org/toc/1996-1073 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2119 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 17 2024 6, p 1361 |
allfields_unstemmed |
10.3390/en17061361 doi (DE-627)DOAJ10051894X (DE-599)DOAJfa3417c9c596413a807f89b4da51c197 DE-627 ger DE-627 rakwb eng Naixiao Wang verfasserin aut Online Distribution Network Scheduling via Provably Robust Learning Approach 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS. distribution network scheduling learn-to-optimize online scheduling machine learning Technology T Xinlei Cai verfasserin aut Linwei Sang verfasserin aut Tingxiang Zhang verfasserin aut Zhongkai Yi verfasserin aut Ying Xu verfasserin aut In Energies MDPI AG, 2008 17(2024), 6, p 1361 (DE-627)572083742 (DE-600)2437446-5 19961073 nnns volume:17 year:2024 number:6, p 1361 https://doi.org/10.3390/en17061361 kostenfrei https://doaj.org/article/fa3417c9c596413a807f89b4da51c197 kostenfrei https://www.mdpi.com/1996-1073/17/6/1361 kostenfrei https://doaj.org/toc/1996-1073 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2119 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 17 2024 6, p 1361 |
allfieldsGer |
10.3390/en17061361 doi (DE-627)DOAJ10051894X (DE-599)DOAJfa3417c9c596413a807f89b4da51c197 DE-627 ger DE-627 rakwb eng Naixiao Wang verfasserin aut Online Distribution Network Scheduling via Provably Robust Learning Approach 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS. distribution network scheduling learn-to-optimize online scheduling machine learning Technology T Xinlei Cai verfasserin aut Linwei Sang verfasserin aut Tingxiang Zhang verfasserin aut Zhongkai Yi verfasserin aut Ying Xu verfasserin aut In Energies MDPI AG, 2008 17(2024), 6, p 1361 (DE-627)572083742 (DE-600)2437446-5 19961073 nnns volume:17 year:2024 number:6, p 1361 https://doi.org/10.3390/en17061361 kostenfrei https://doaj.org/article/fa3417c9c596413a807f89b4da51c197 kostenfrei https://www.mdpi.com/1996-1073/17/6/1361 kostenfrei https://doaj.org/toc/1996-1073 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2119 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 17 2024 6, p 1361 |
allfieldsSound |
10.3390/en17061361 doi (DE-627)DOAJ10051894X (DE-599)DOAJfa3417c9c596413a807f89b4da51c197 DE-627 ger DE-627 rakwb eng Naixiao Wang verfasserin aut Online Distribution Network Scheduling via Provably Robust Learning Approach 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS. distribution network scheduling learn-to-optimize online scheduling machine learning Technology T Xinlei Cai verfasserin aut Linwei Sang verfasserin aut Tingxiang Zhang verfasserin aut Zhongkai Yi verfasserin aut Ying Xu verfasserin aut In Energies MDPI AG, 2008 17(2024), 6, p 1361 (DE-627)572083742 (DE-600)2437446-5 19961073 nnns volume:17 year:2024 number:6, p 1361 https://doi.org/10.3390/en17061361 kostenfrei https://doaj.org/article/fa3417c9c596413a807f89b4da51c197 kostenfrei https://www.mdpi.com/1996-1073/17/6/1361 kostenfrei https://doaj.org/toc/1996-1073 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2119 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 17 2024 6, p 1361 |
language |
English |
source |
In Energies 17(2024), 6, p 1361 volume:17 year:2024 number:6, p 1361 |
sourceStr |
In Energies 17(2024), 6, p 1361 volume:17 year:2024 number:6, p 1361 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
distribution network scheduling learn-to-optimize online scheduling machine learning Technology T |
isfreeaccess_bool |
true |
container_title |
Energies |
authorswithroles_txt_mv |
Naixiao Wang @@aut@@ Xinlei Cai @@aut@@ Linwei Sang @@aut@@ Tingxiang Zhang @@aut@@ Zhongkai Yi @@aut@@ Ying Xu @@aut@@ |
publishDateDaySort_date |
2024-01-01T00:00:00Z |
hierarchy_top_id |
572083742 |
id |
DOAJ10051894X |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ10051894X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240414100314.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240414s2024 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/en17061361</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ10051894X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJfa3417c9c596413a807f89b4da51c197</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="0" ind2=" "><subfield code="a">Naixiao Wang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Online Distribution Network Scheduling via Provably Robust Learning Approach</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2024</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="520" ind1=" " ind2=" "><subfield code="a">Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">distribution network scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">learn-to-optimize</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">online scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">machine learning</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Technology</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">T</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Xinlei Cai</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Linwei Sang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Tingxiang Zhang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Zhongkai Yi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Ying Xu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Energies</subfield><subfield code="d">MDPI AG, 2008</subfield><subfield code="g">17(2024), 6, p 1361</subfield><subfield code="w">(DE-627)572083742</subfield><subfield code="w">(DE-600)2437446-5</subfield><subfield code="x">19961073</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:17</subfield><subfield code="g">year:2024</subfield><subfield code="g">number:6, p 1361</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/en17061361</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/fa3417c9c596413a807f89b4da51c197</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/1996-1073/17/6/1361</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1996-1073</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</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_DOAJ</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_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_206</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_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</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_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2119</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">17</subfield><subfield code="j">2024</subfield><subfield code="e">6, p 1361</subfield></datafield></record></collection>
|
author |
Naixiao Wang |
spellingShingle |
Naixiao Wang misc distribution network scheduling misc learn-to-optimize misc online scheduling misc machine learning misc Technology misc T Online Distribution Network Scheduling via Provably Robust Learning Approach |
authorStr |
Naixiao Wang |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)572083742 |
format |
electronic Article |
delete_txt_mv |
keep |
author_role |
aut aut aut aut aut aut |
collection |
DOAJ |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
19961073 |
topic_title |
Online Distribution Network Scheduling via Provably Robust Learning Approach distribution network scheduling learn-to-optimize online scheduling machine learning |
topic |
misc distribution network scheduling misc learn-to-optimize misc online scheduling misc machine learning misc Technology misc T |
topic_unstemmed |
misc distribution network scheduling misc learn-to-optimize misc online scheduling misc machine learning misc Technology misc T |
topic_browse |
misc distribution network scheduling misc learn-to-optimize misc online scheduling misc machine learning misc Technology misc T |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Energies |
hierarchy_parent_id |
572083742 |
hierarchy_top_title |
Energies |
isfreeaccess_txt |
true |
familylinks_str_mv |
(DE-627)572083742 (DE-600)2437446-5 |
title |
Online Distribution Network Scheduling via Provably Robust Learning Approach |
ctrlnum |
(DE-627)DOAJ10051894X (DE-599)DOAJfa3417c9c596413a807f89b4da51c197 |
title_full |
Online Distribution Network Scheduling via Provably Robust Learning Approach |
author_sort |
Naixiao Wang |
journal |
Energies |
journalStr |
Energies |
lang_code |
eng |
isOA_bool |
true |
recordtype |
marc |
publishDateSort |
2024 |
contenttype_str_mv |
txt |
author_browse |
Naixiao Wang Xinlei Cai Linwei Sang Tingxiang Zhang Zhongkai Yi Ying Xu |
container_volume |
17 |
format_se |
Elektronische Aufsätze |
author-letter |
Naixiao Wang |
doi_str_mv |
10.3390/en17061361 |
author2-role |
verfasserin |
title_sort |
online distribution network scheduling via provably robust learning approach |
title_auth |
Online Distribution Network Scheduling via Provably Robust Learning Approach |
abstract |
Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS. |
abstractGer |
Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS. |
abstract_unstemmed |
Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS. |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 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_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2119 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, p 1361 |
title_short |
Online Distribution Network Scheduling via Provably Robust Learning Approach |
url |
https://doi.org/10.3390/en17061361 https://doaj.org/article/fa3417c9c596413a807f89b4da51c197 https://www.mdpi.com/1996-1073/17/6/1361 https://doaj.org/toc/1996-1073 |
remote_bool |
true |
author2 |
Xinlei Cai Linwei Sang Tingxiang Zhang Zhongkai Yi Ying Xu |
author2Str |
Xinlei Cai Linwei Sang Tingxiang Zhang Zhongkai Yi Ying Xu |
ppnlink |
572083742 |
mediatype_str_mv |
c |
isOA_txt |
true |
hochschulschrift_bool |
false |
doi_str |
10.3390/en17061361 |
up_date |
2024-07-03T15:10:02.629Z |
_version_ |
1803571065137397760 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ10051894X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240414100314.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240414s2024 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/en17061361</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ10051894X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJfa3417c9c596413a807f89b4da51c197</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="0" ind2=" "><subfield code="a">Naixiao Wang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Online Distribution Network Scheduling via Provably Robust Learning Approach</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2024</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="520" ind1=" " ind2=" "><subfield code="a">Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">distribution network scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">learn-to-optimize</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">online scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">machine learning</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Technology</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">T</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Xinlei Cai</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Linwei Sang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Tingxiang Zhang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Zhongkai Yi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Ying Xu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Energies</subfield><subfield code="d">MDPI AG, 2008</subfield><subfield code="g">17(2024), 6, p 1361</subfield><subfield code="w">(DE-627)572083742</subfield><subfield code="w">(DE-600)2437446-5</subfield><subfield code="x">19961073</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:17</subfield><subfield code="g">year:2024</subfield><subfield code="g">number:6, p 1361</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/en17061361</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/fa3417c9c596413a807f89b4da51c197</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/1996-1073/17/6/1361</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1996-1073</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</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_DOAJ</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_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_206</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_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</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_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2119</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">17</subfield><subfield code="j">2024</subfield><subfield code="e">6, p 1361</subfield></datafield></record></collection>
|
score |
7.399522 |