Method and system for solving Hamiltonian shortest path based on neural combinatorial optimizer
The invention provides a method and system for solving the shortest Hamiltonian path based on a neural combinatorial optimizer, and relates to the technical field of intelligent calculation and path planning, and the method comprises the steps: designing a shortest Hamiltonian path problem framework...
Saved in:
Main Authors | , , , |
---|---|
Format | Patent |
Language | Chinese English |
Published |
23.01.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | The invention provides a method and system for solving the shortest Hamiltonian path based on a neural combinatorial optimizer, and relates to the technical field of intelligent calculation and path planning, and the method comprises the steps: designing a shortest Hamiltonian path problem framework; designing a neural combination optimizer model based on the encoder-decoder structure; hamiltonian problem instances used for training the neural combination optimizer are randomly generated, and data of all the problem instances are preprocessed through a minimum-maximum normalization and rotation coordinate transformation strategy; inputting the processed data into the neural combination optimizer model for training, and performing optimization by adopting a bidirectional strategy gradient function to obtain a trained neural combination optimizer model; and solving the shortest Hamiltonian path problem containing N nodes by using the trained neural combination optimizer model to obtain an optimal Hamiltonian pa |
---|---|
AbstractList | The invention provides a method and system for solving the shortest Hamiltonian path based on a neural combinatorial optimizer, and relates to the technical field of intelligent calculation and path planning, and the method comprises the steps: designing a shortest Hamiltonian path problem framework; designing a neural combination optimizer model based on the encoder-decoder structure; hamiltonian problem instances used for training the neural combination optimizer are randomly generated, and data of all the problem instances are preprocessed through a minimum-maximum normalization and rotation coordinate transformation strategy; inputting the processed data into the neural combination optimizer model for training, and performing optimization by adopting a bidirectional strategy gradient function to obtain a trained neural combination optimizer model; and solving the shortest Hamiltonian path problem containing N nodes by using the trained neural combination optimizer model to obtain an optimal Hamiltonian pa |
Author | LI FANCHANG JIANG ZENGHUI LIANG HELAN GUO HONGWEI |
Author_xml | – fullname: JIANG ZENGHUI – fullname: GUO HONGWEI – fullname: LIANG HELAN – fullname: LI FANCHANG |
BookMark | eNqNyjsKwkAQgOEUWvi6w3gAixCfpQQljVb2YZJMzMLuzLIzCnp6LTyA1c8H_zQbsTBNsvpCNkgHyB3oS40C9JJAxT8d36HC4LwJO2TQQZKRGkS0ARpU6kAYmB4JPbQSGsdoktxXEs0F96Y0z8Y9eqXFr7NseT7dympFUWrSiC0xWV1e83y3Lrabw_5Y_PN8AAqDP2U |
ContentType | Patent |
DBID | EVB |
DatabaseName | esp@cenet |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: EVB name: esp@cenet url: http://worldwide.espacenet.com/singleLineSearch?locale=en_EP sourceTypes: Open Access Repository |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Medicine Chemistry Sciences Physics |
DocumentTitleAlternate | 基于神经组合优化器求解哈密顿最短路径的方法及系统 |
ExternalDocumentID | CN117436598A |
GroupedDBID | EVB |
ID | FETCH-epo_espacenet_CN117436598A3 |
IEDL.DBID | EVB |
IngestDate | Fri Jul 19 13:11:51 EDT 2024 |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | Chinese English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-epo_espacenet_CN117436598A3 |
Notes | Application Number: CN202311488722 |
OpenAccessLink | https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20240123&DB=EPODOC&CC=CN&NR=117436598A |
ParticipantIDs | epo_espacenet_CN117436598A |
PublicationCentury | 2000 |
PublicationDate | 20240123 |
PublicationDateYYYYMMDD | 2024-01-23 |
PublicationDate_xml | – month: 01 year: 2024 text: 20240123 day: 23 |
PublicationDecade | 2020 |
PublicationYear | 2024 |
RelatedCompanies | SOOCHOW UNIVERSITY |
RelatedCompanies_xml | – name: SOOCHOW UNIVERSITY |
Score | 3.6308908 |
Snippet | The invention provides a method and system for solving the shortest Hamiltonian path based on a neural combinatorial optimizer, and relates to the technical... |
SourceID | epo |
SourceType | Open Access Repository |
SubjectTerms | CALCULATING COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS COMPUTING COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ELECTRIC DIGITAL DATA PROCESSING PHYSICS SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR |
Title | Method and system for solving Hamiltonian shortest path based on neural combinatorial optimizer |
URI | https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20240123&DB=EPODOC&locale=&CC=CN&NR=117436598A |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LS8NAEB5qfd60KlofjCC5BWtrl_QQxG4agtC0SJXeSjbZ0oompYkI_fXOrK31otcNLLuTncc3O_sNwLVoCcUcL7bTSJhUO1Y24Sxhj8k5CxU7amxu8LuhCJ7vHofNYQleV29hDE_opyFHJI2KSd8LY69n6ySWZ2or8xs1paHs3h-4nrVEx-SeyBJbXtvt9HteT1pSujK0wif3liNv0Ww5DxuwyWE08-x3Xtr8KmX226X4-7DVp9nS4gBKi0kFduWq81oFdrrLC-8KbJsKzTinwaUW5ocw6pq2zxilCX4zMSOFnkiniLMDGHDOgkI6-vGYT7iYNi-QOw8ju6wEsxSZxTJ6Q9oyAWOG3XQKMSPr8T5d6PkRXPmdgQxsWvPoR0AjGa631ziGcpql-gRQJIQWnFgx6R3jElXT9Shqah1pVXPGrVOo_j1P9b-PZ7DHwuZURL1xDuVi_qEvyDkX6tJI9Qt9bJVP |
link.rule.ids | 230,309,786,891,25594,76906 |
linkProvider | European Patent Office |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dT8IwEL8gfuCbokbxqyZmb4sIUsfDYrSDTGWDGDS8LetWAkY3wmZM-Ou9qyC-6GuXNO2t9_G7Xn8HcM6bXBLHi2nVYyLVjqSJOIubQ3TOXEaWHOobfM_n7vPVw6AxKMDr4i2M5gn91OSIqFER6nuu7fVkmcRydG1ldiHHOJTetPu2Y8zRMbontMSGc2e3el2nKwwhbOEb_pN9SZE3bzSt2xVYvSZ2XgqdXu7oVcrkt0tpb8FaD2dL8m0ozEZlKIlF57UybHjzC-8yrOsKzSjDwbkWZjsQeLrtMwuTmH0zMTMMPRmeIsoOMJdyFhjS4Y9n2YiKabOcUedhRi4rZmnCiMUyfGO4ZQTGBLvxFLIUrcf7eKamu3DWbvWFa-Kagx8BBcJfbq--B8UkTdQ-MB4jWrAiSaR3hEtkVdXCsKFUqGTVGjYPoPL3PJX_Pp5Cye17naBz7z8ewiYJntIStfoRFPPphzpGR53LEy3hL6K4mDw |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Apatent&rft.title=Method+and+system+for+solving+Hamiltonian+shortest+path+based+on+neural+combinatorial+optimizer&rft.inventor=JIANG+ZENGHUI&rft.inventor=GUO+HONGWEI&rft.inventor=LIANG+HELAN&rft.inventor=LI+FANCHANG&rft.date=2024-01-23&rft.externalDBID=A&rft.externalDocID=CN117436598A |