Sparse ant system supporting large-scale combination optimization problem and solving method
The invention provides a sparse ant system supporting a large-scale combination optimization problem. The system comprises an initial solution construction module, an iterative solving module, a sparse pheromone matrix update module and an optimal solution calculation module. The invention furthermo...
Saved in:
Main Authors | , , , , , , , |
---|---|
Format | Patent |
Language | Chinese English |
Published |
28.09.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | The invention provides a sparse ant system supporting a large-scale combination optimization problem. The system comprises an initial solution construction module, an iterative solving module, a sparse pheromone matrix update module and an optimal solution calculation module. The invention furthermore provides a method for calculating an optimal solution of the large-scale combination optimizationproblem by using the sparse ant system. The method comprises the steps of 1, constructing an initial solution; 2, calculating optimal solutions by multi-time iteration, calculating global iterative optimal solutions in M ants, circulating each ant for N times, obtaining a sub-step solution node j during each calculation, finally obtaining feasible solutions of current iteration, selecting the global optimal solution in the feasible solutions of the M ants, and performing comparison and update on the global optimal solution of the current iteration and the iterative optimal solution so far; 3,after each iteration is f |
---|---|
AbstractList | The invention provides a sparse ant system supporting a large-scale combination optimization problem. The system comprises an initial solution construction module, an iterative solving module, a sparse pheromone matrix update module and an optimal solution calculation module. The invention furthermore provides a method for calculating an optimal solution of the large-scale combination optimizationproblem by using the sparse ant system. The method comprises the steps of 1, constructing an initial solution; 2, calculating optimal solutions by multi-time iteration, calculating global iterative optimal solutions in M ants, circulating each ant for N times, obtaining a sub-step solution node j during each calculation, finally obtaining feasible solutions of current iteration, selecting the global optimal solution in the feasible solutions of the M ants, and performing comparison and update on the global optimal solution of the current iteration and the iterative optimal solution so far; 3,after each iteration is f |
Author | CHEN YANG HUANG ZHIBIN SHI BO WANG ZIZHE TANG XIN LI JIAYU LYU YING WU JINGFEI |
Author_xml | – fullname: CHEN YANG – fullname: LI JIAYU – fullname: LYU YING – fullname: SHI BO – fullname: WU JINGFEI – fullname: WANG ZIZHE – fullname: HUANG ZHIBIN – fullname: TANG XIN |
BookMark | eNqNi0sKwjAQQLPQhb87jAcoqMWiSymKKze6FMq0HWsgmQmZKOjpVfQArh4P3huaHgvTwJyPAaMSICfQhybyoLcQJCbLHTiMHWXaoCNoxNeWMVlhkJCst8-vhCi1e3_ILai4-2f0lK7Sjk3_gk5p8uPITHfbU7nPKEhFGrAhplSVh_lstVwX-aLY5P80L3-6PqM |
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 | CN108596326A |
GroupedDBID | EVB |
ID | FETCH-epo_espacenet_CN108596326A3 |
IEDL.DBID | EVB |
IngestDate | Fri Jul 19 16:28:37 EDT 2024 |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | Chinese English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-epo_espacenet_CN108596326A3 |
Notes | Application Number: CN20181376662 |
OpenAccessLink | https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20180928&DB=EPODOC&CC=CN&NR=108596326A |
ParticipantIDs | epo_espacenet_CN108596326A |
PublicationCentury | 2000 |
PublicationDate | 20180928 |
PublicationDateYYYYMMDD | 2018-09-28 |
PublicationDate_xml | – month: 09 year: 2018 text: 20180928 day: 28 |
PublicationDecade | 2010 |
PublicationYear | 2018 |
RelatedCompanies | BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS |
RelatedCompanies_xml | – name: BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS |
Score | 3.2894542 |
Snippet | The invention provides a sparse ant system supporting a large-scale combination optimization problem. The system comprises an initial solution construction... |
SourceID | epo |
SourceType | Open Access Repository |
SubjectTerms | CALCULATING COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS COMPUTING COUNTING PHYSICS |
Title | Sparse ant system supporting large-scale combination optimization problem and solving method |
URI | https://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20180928&DB=EPODOC&locale=&CC=CN&NR=108596326A |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dS8MwED_m_HzT6dD5QQTpW1HbmGwPRVy6MYR1Q6fsQRj9SFDRrtgOwb_eS9Y5X_Q1haN3yeVyye9-B3DGeUgvI8nthLrMpiGVdnjhKpviXDs8TJRrKPP7Aes90Nvx1bgCr4taGMMT-mnIEdGjYvT3wuzX2fISyzfYyvw8esGh6XV35PlWmR1rMiqnafltrzMc-ANhCeGJwAruPA2yx7XmsJsVWNXHaM2z33ls66qU7HdI6W7D2hClpcUOVL6ea7ApFp3XarDRLx-8a7BuEJpxjoOlF-a78HSfYToqCRqFzJmYST7L9EEa4xB509huO0fbS4I6YeZr9CFT3Bzey6pLUvaRQREJwdWnbxXIvJn0Hpx2OyPRs_GHJz_WmYhgqZtbh2o6TeU-EFe1WCIVc6hsUdVkIY9opHgsFac04eoAGn_Lafz38RC2tKU1aMJpHkG1-JjJY4zMRXRiTPoNwGOVWQ |
link.rule.ids | 230,309,786,891,25594,76903 |
linkProvider | European Patent Office |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dT8IwEL8gfuCbokbxqyZmb4u61RUeFiMdBBUGUTQ8kCwba6NGYXEjJv71XssQX_S1TS6933q9Xve7O4BTxkJ6EQlmxtR2TBpSYYbntjQpfmuLhbG0dcn8ju-0Hunt4HJQgNd5LoyuE_qpiyOiRY3Q3jN9XieLRyxPcyvTs-gFhyZXzb7rGXl0rIpRWVXDq7uNXtfrcoNzl_uGf-8qkj3uNcu5XoJlhiGhDpWe6iorJfntUpobsNJDaeNsEwpfz2Uo8XnntTKsdfIf3mVY1QzNUYqDuRWmWzB8SDAcFQRBIbNKzCSdJuoijX6IvClut5ki9oKgThj5an3IBA-H9zzrkuR9ZFBETHD3qVcFMmsmvQ0nzUaft0xccPCDTsD9hW72DhTHk7HYBWLLmhML6VhU1KisOiGLaCTZSEhGaczkHlT-llP5b_IYSq1-px20b_y7fVhXqCsChVU9gGL2MRWH6KWz6EjD-w3hLJhD |
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=Sparse+ant+system+supporting+large-scale+combination+optimization+problem+and+solving+method&rft.inventor=CHEN+YANG&rft.inventor=LI+JIAYU&rft.inventor=LYU+YING&rft.inventor=SHI+BO&rft.inventor=WU+JINGFEI&rft.inventor=WANG+ZIZHE&rft.inventor=HUANG+ZHIBIN&rft.inventor=TANG+XIN&rft.date=2018-09-28&rft.externalDBID=A&rft.externalDocID=CN108596326A |