Mine digital twin system network route planning method based on migration optimization algorithm

The invention relates to a mine digital twin system underlying network route planning method based on a migration algorithm, and the method comprises the steps: determining k route planning tasks which comprise one current task and (k-1) historical similar tasks; determining an optimization target o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: MA LIANG, LI PENG, HOU RONGZHE, HAN BAOSHAN, FAN TAO, LIU ZAIBIN, AN LIN, LI GUIHONG
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 MA LIANG
LI PENG
HOU RONGZHE
HAN BAOSHAN
FAN TAO
LIU ZAIBIN
AN LIN
LI GUIHONG
description The invention relates to a mine digital twin system underlying network route planning method based on a migration algorithm, and the method comprises the steps: determining k route planning tasks which comprise one current task and (k-1) historical similar tasks; determining an optimization target of each route planning task, wherein a variable in the optimization target is a route planning scheme; the optimization targets of the k-1 historical similar tasks are k-1 routing planning scheme evaluation agent models; and solving the optimization targets corresponding to the k routing planning tasks by adopting a multi-target optimization algorithm to obtain an optimal routing planning scheme of the current task. Similar problems in historical configuration records are found according to the characteristics of the current underlying routing needing to be configured, the current network routing planning problem is solved at the same time, the result in the process of solving is migrated to the current planning tas
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN116055336A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN116055336A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN116055336A3</originalsourceid><addsrcrecordid>eNqNjUEKwkAMRbtxIeod4gEES2n3UhQ3unKv0cZpcCYZZiJFT29BD-DqvwcP_rS4HFgIOnZs6MEGFsivbBRAyAZND0j6NILoUYTFQSDrtYMrZupABQK7hMYjaTQO_P4KeqeJrQ_zYnJHn2nx21mx3G1P7X5FUc-UI95ofDq3x7Js1nVdVc2m-qf5AC6NPjY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Mine digital twin system network route planning method based on migration optimization algorithm</title><source>esp@cenet</source><creator>MA LIANG ; LI PENG ; HOU RONGZHE ; HAN BAOSHAN ; FAN TAO ; LIU ZAIBIN ; AN LIN ; LI GUIHONG</creator><creatorcontrib>MA LIANG ; LI PENG ; HOU RONGZHE ; HAN BAOSHAN ; FAN TAO ; LIU ZAIBIN ; AN LIN ; LI GUIHONG</creatorcontrib><description>The invention relates to a mine digital twin system underlying network route planning method based on a migration algorithm, and the method comprises the steps: determining k route planning tasks which comprise one current task and (k-1) historical similar tasks; determining an optimization target of each route planning task, wherein a variable in the optimization target is a route planning scheme; the optimization targets of the k-1 historical similar tasks are k-1 routing planning scheme evaluation agent models; and solving the optimization targets corresponding to the k routing planning tasks by adopting a multi-target optimization algorithm to obtain an optimal routing planning scheme of the current task. Similar problems in historical configuration records are found according to the characteristics of the current underlying routing needing to be configured, the current network routing planning problem is solved at the same time, the result in the process of solving is migrated to the current planning tas</description><language>chi ; eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2023</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=20230502&amp;DB=EPODOC&amp;CC=CN&amp;NR=116055336A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20230502&amp;DB=EPODOC&amp;CC=CN&amp;NR=116055336A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>MA LIANG</creatorcontrib><creatorcontrib>LI PENG</creatorcontrib><creatorcontrib>HOU RONGZHE</creatorcontrib><creatorcontrib>HAN BAOSHAN</creatorcontrib><creatorcontrib>FAN TAO</creatorcontrib><creatorcontrib>LIU ZAIBIN</creatorcontrib><creatorcontrib>AN LIN</creatorcontrib><creatorcontrib>LI GUIHONG</creatorcontrib><title>Mine digital twin system network route planning method based on migration optimization algorithm</title><description>The invention relates to a mine digital twin system underlying network route planning method based on a migration algorithm, and the method comprises the steps: determining k route planning tasks which comprise one current task and (k-1) historical similar tasks; determining an optimization target of each route planning task, wherein a variable in the optimization target is a route planning scheme; the optimization targets of the k-1 historical similar tasks are k-1 routing planning scheme evaluation agent models; and solving the optimization targets corresponding to the k routing planning tasks by adopting a multi-target optimization algorithm to obtain an optimal routing planning scheme of the current task. Similar problems in historical configuration records are found according to the characteristics of the current underlying routing needing to be configured, the current network routing planning problem is solved at the same time, the result in the process of solving is migrated to the current planning tas</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNjUEKwkAMRbtxIeod4gEES2n3UhQ3unKv0cZpcCYZZiJFT29BD-DqvwcP_rS4HFgIOnZs6MEGFsivbBRAyAZND0j6NILoUYTFQSDrtYMrZupABQK7hMYjaTQO_P4KeqeJrQ_zYnJHn2nx21mx3G1P7X5FUc-UI95ofDq3x7Js1nVdVc2m-qf5AC6NPjY</recordid><startdate>20230502</startdate><enddate>20230502</enddate><creator>MA LIANG</creator><creator>LI PENG</creator><creator>HOU RONGZHE</creator><creator>HAN BAOSHAN</creator><creator>FAN TAO</creator><creator>LIU ZAIBIN</creator><creator>AN LIN</creator><creator>LI GUIHONG</creator><scope>EVB</scope></search><sort><creationdate>20230502</creationdate><title>Mine digital twin system network route planning method based on migration optimization algorithm</title><author>MA LIANG ; LI PENG ; HOU RONGZHE ; HAN BAOSHAN ; FAN TAO ; LIU ZAIBIN ; AN LIN ; LI GUIHONG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN116055336A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2023</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>MA LIANG</creatorcontrib><creatorcontrib>LI PENG</creatorcontrib><creatorcontrib>HOU RONGZHE</creatorcontrib><creatorcontrib>HAN BAOSHAN</creatorcontrib><creatorcontrib>FAN TAO</creatorcontrib><creatorcontrib>LIU ZAIBIN</creatorcontrib><creatorcontrib>AN LIN</creatorcontrib><creatorcontrib>LI GUIHONG</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>MA LIANG</au><au>LI PENG</au><au>HOU RONGZHE</au><au>HAN BAOSHAN</au><au>FAN TAO</au><au>LIU ZAIBIN</au><au>AN LIN</au><au>LI GUIHONG</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Mine digital twin system network route planning method based on migration optimization algorithm</title><date>2023-05-02</date><risdate>2023</risdate><abstract>The invention relates to a mine digital twin system underlying network route planning method based on a migration algorithm, and the method comprises the steps: determining k route planning tasks which comprise one current task and (k-1) historical similar tasks; determining an optimization target of each route planning task, wherein a variable in the optimization target is a route planning scheme; the optimization targets of the k-1 historical similar tasks are k-1 routing planning scheme evaluation agent models; and solving the optimization targets corresponding to the k routing planning tasks by adopting a multi-target optimization algorithm to obtain an optimal routing planning scheme of the current task. Similar problems in historical configuration records are found according to the characteristics of the current underlying routing needing to be configured, the current network routing planning problem is solved at the same time, the result in the process of solving is migrated to the current planning tas</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language chi ; eng
recordid cdi_epo_espacenet_CN116055336A
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Mine digital twin system network route planning method based on migration optimization algorithm
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T19%3A59%3A14IST&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=MA%20LIANG&rft.date=2023-05-02&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN116055336A%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