Distributed energy transaction matching method based on energy network constraints and multiple knapsack problems

The invention belongs to the field of distributed energy transaction. The distributed energy transaction matching method based on energy network constraints and multiple knapsack problems comprises the following steps: 1) by designing an augmented optimization model of energy scheduling, constrainin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: DING TAO, LIU JIAN, QU MING, NING KE'ER, MU CHENGGANG, WANG YONGQING, CHEN TIAN'EN, ZHANG XIAOMENG, DONG XIAOBO, QI JIE, HE YUANKANG, DONG JIANGBIN
Format: Patent
Sprache:chi ; eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator DING TAO
LIU JIAN
QU MING
NING KE'ER
MU CHENGGANG
WANG YONGQING
CHEN TIAN'EN
ZHANG XIAOMENG
DONG XIAOBO
QI JIE
HE YUANKANG
DONG JIANGBIN
description The invention belongs to the field of distributed energy transaction. The distributed energy transaction matching method based on energy network constraints and multiple knapsack problems comprises the following steps: 1) by designing an augmented optimization model of energy scheduling, constraining the transaction volume of a user to be a relatively small value of a declaration volume and an energy network limit volume, and adding a safety check link for distributed transaction; and 2) based on a traditional single knapsack model, designing a multi-knapsack model which is more consistent with point-to-point transaction by taking the maximum market transaction value as a target, and performing transaction matching on a plurality of buyers and sellers. According to the method, an idea is provided for connection of energy distributed transaction and actual physical scheduling, a universal and efficient matching model is provided for a point-to-point distributed transaction market, and the method has relatively
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN111429281A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN111429281A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN111429281A3</originalsourceid><addsrcrecordid>eNqNzDEOwjAMheEuDAi4gzkAQwoDjKiAmJjYKzc1bZTECYkrxO3J0AMwveH9-pbV-2KyJNNNQj0QUxq-IAk5oxYTGDyKHg0P4EnG0EOHuYTlmFsm-YRkQQcuDhqWDMg9-MmJiY7AMsaCWYgpdI58XleLF7pMm3lX1fZ2fTb3HcXQUo6oCy1t81BKHepTfVTn_T_ND1JFROg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Distributed energy transaction matching method based on energy network constraints and multiple knapsack problems</title><source>esp@cenet</source><creator>DING TAO ; LIU JIAN ; QU MING ; NING KE'ER ; MU CHENGGANG ; WANG YONGQING ; CHEN TIAN'EN ; ZHANG XIAOMENG ; DONG XIAOBO ; QI JIE ; HE YUANKANG ; DONG JIANGBIN</creator><creatorcontrib>DING TAO ; LIU JIAN ; QU MING ; NING KE'ER ; MU CHENGGANG ; WANG YONGQING ; CHEN TIAN'EN ; ZHANG XIAOMENG ; DONG XIAOBO ; QI JIE ; HE YUANKANG ; DONG JIANGBIN</creatorcontrib><description>The invention belongs to the field of distributed energy transaction. The distributed energy transaction matching method based on energy network constraints and multiple knapsack problems comprises the following steps: 1) by designing an augmented optimization model of energy scheduling, constraining the transaction volume of a user to be a relatively small value of a declaration volume and an energy network limit volume, and adding a safety check link for distributed transaction; and 2) based on a traditional single knapsack model, designing a multi-knapsack model which is more consistent with point-to-point transaction by taking the maximum market transaction value as a target, and performing transaction matching on a plurality of buyers and sellers. According to the method, an idea is provided for connection of energy distributed transaction and actual physical scheduling, a universal and efficient matching model is provided for a point-to-point distributed transaction market, and the method has relatively</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; PHYSICS ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><creationdate>2020</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20200717&amp;DB=EPODOC&amp;CC=CN&amp;NR=111429281A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25555,76308</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20200717&amp;DB=EPODOC&amp;CC=CN&amp;NR=111429281A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>DING TAO</creatorcontrib><creatorcontrib>LIU JIAN</creatorcontrib><creatorcontrib>QU MING</creatorcontrib><creatorcontrib>NING KE'ER</creatorcontrib><creatorcontrib>MU CHENGGANG</creatorcontrib><creatorcontrib>WANG YONGQING</creatorcontrib><creatorcontrib>CHEN TIAN'EN</creatorcontrib><creatorcontrib>ZHANG XIAOMENG</creatorcontrib><creatorcontrib>DONG XIAOBO</creatorcontrib><creatorcontrib>QI JIE</creatorcontrib><creatorcontrib>HE YUANKANG</creatorcontrib><creatorcontrib>DONG JIANGBIN</creatorcontrib><title>Distributed energy transaction matching method based on energy network constraints and multiple knapsack problems</title><description>The invention belongs to the field of distributed energy transaction. The distributed energy transaction matching method based on energy network constraints and multiple knapsack problems comprises the following steps: 1) by designing an augmented optimization model of energy scheduling, constraining the transaction volume of a user to be a relatively small value of a declaration volume and an energy network limit volume, and adding a safety check link for distributed transaction; and 2) based on a traditional single knapsack model, designing a multi-knapsack model which is more consistent with point-to-point transaction by taking the maximum market transaction value as a target, and performing transaction matching on a plurality of buyers and sellers. According to the method, an idea is provided for connection of energy distributed transaction and actual physical scheduling, a universal and efficient matching model is provided for a point-to-point distributed transaction market, and the method has relatively</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>PHYSICS</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2020</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNzDEOwjAMheEuDAi4gzkAQwoDjKiAmJjYKzc1bZTECYkrxO3J0AMwveH9-pbV-2KyJNNNQj0QUxq-IAk5oxYTGDyKHg0P4EnG0EOHuYTlmFsm-YRkQQcuDhqWDMg9-MmJiY7AMsaCWYgpdI58XleLF7pMm3lX1fZ2fTb3HcXQUo6oCy1t81BKHepTfVTn_T_ND1JFROg</recordid><startdate>20200717</startdate><enddate>20200717</enddate><creator>DING TAO</creator><creator>LIU JIAN</creator><creator>QU MING</creator><creator>NING KE'ER</creator><creator>MU CHENGGANG</creator><creator>WANG YONGQING</creator><creator>CHEN TIAN'EN</creator><creator>ZHANG XIAOMENG</creator><creator>DONG XIAOBO</creator><creator>QI JIE</creator><creator>HE YUANKANG</creator><creator>DONG JIANGBIN</creator><scope>EVB</scope></search><sort><creationdate>20200717</creationdate><title>Distributed energy transaction matching method based on energy network constraints and multiple knapsack problems</title><author>DING TAO ; LIU JIAN ; QU MING ; NING KE'ER ; MU CHENGGANG ; WANG YONGQING ; CHEN TIAN'EN ; ZHANG XIAOMENG ; DONG XIAOBO ; QI JIE ; HE YUANKANG ; DONG JIANGBIN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN111429281A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2020</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>PHYSICS</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><toplevel>online_resources</toplevel><creatorcontrib>DING TAO</creatorcontrib><creatorcontrib>LIU JIAN</creatorcontrib><creatorcontrib>QU MING</creatorcontrib><creatorcontrib>NING KE'ER</creatorcontrib><creatorcontrib>MU CHENGGANG</creatorcontrib><creatorcontrib>WANG YONGQING</creatorcontrib><creatorcontrib>CHEN TIAN'EN</creatorcontrib><creatorcontrib>ZHANG XIAOMENG</creatorcontrib><creatorcontrib>DONG XIAOBO</creatorcontrib><creatorcontrib>QI JIE</creatorcontrib><creatorcontrib>HE YUANKANG</creatorcontrib><creatorcontrib>DONG JIANGBIN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>DING TAO</au><au>LIU JIAN</au><au>QU MING</au><au>NING KE'ER</au><au>MU CHENGGANG</au><au>WANG YONGQING</au><au>CHEN TIAN'EN</au><au>ZHANG XIAOMENG</au><au>DONG XIAOBO</au><au>QI JIE</au><au>HE YUANKANG</au><au>DONG JIANGBIN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Distributed energy transaction matching method based on energy network constraints and multiple knapsack problems</title><date>2020-07-17</date><risdate>2020</risdate><abstract>The invention belongs to the field of distributed energy transaction. The distributed energy transaction matching method based on energy network constraints and multiple knapsack problems comprises the following steps: 1) by designing an augmented optimization model of energy scheduling, constraining the transaction volume of a user to be a relatively small value of a declaration volume and an energy network limit volume, and adding a safety check link for distributed transaction; and 2) based on a traditional single knapsack model, designing a multi-knapsack model which is more consistent with point-to-point transaction by taking the maximum market transaction value as a target, and performing transaction matching on a plurality of buyers and sellers. According to the method, an idea is provided for connection of energy distributed transaction and actual physical scheduling, a universal and efficient matching model is provided for a point-to-point distributed transaction market, and the method has relatively</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language chi ; eng
recordid cdi_epo_espacenet_CN111429281A
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES
PHYSICS
SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR
title Distributed energy transaction matching method based on energy network constraints and multiple knapsack problems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T04%3A53%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=DING%20TAO&rft.date=2020-07-17&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN111429281A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true