离散型细菌觅食算法求解TSP
旅行商问题（TSP）是组合优化问题的典型代表,针对TSP的求解提出一种离散型细菌觅食（DBFO）算法。该算法通过结合2-opt算法设计了一种适合处理离散型变量的趋化算子,将细菌觅食算法推广到了离散情形。同时,结合TSP的特点,在迁徙算子中引入基因库的思想来指导新个体的生成,提高了算法的搜索效率。通过对TSPLIB标准库中22个实例进行仿真实验。实验结果表明,该算法能够有效求解城市规模500以下的TSP,与混合蚁群算法和离散型萤火虫群算法相比,具有更好的全局收敛性和稳定性。...
Saved in:
| Published in | 计算机应用研究 Vol. 31; no. 12; pp. 3642 - 3645 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
大连海事大学交通运输管理学院,辽宁大连,116026
2014
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2014.12.032 |
Cover
| Abstract | 旅行商问题（TSP）是组合优化问题的典型代表,针对TSP的求解提出一种离散型细菌觅食（DBFO）算法。该算法通过结合2-opt算法设计了一种适合处理离散型变量的趋化算子,将细菌觅食算法推广到了离散情形。同时,结合TSP的特点,在迁徙算子中引入基因库的思想来指导新个体的生成,提高了算法的搜索效率。通过对TSPLIB标准库中22个实例进行仿真实验。实验结果表明,该算法能够有效求解城市规模500以下的TSP,与混合蚁群算法和离散型萤火虫群算法相比,具有更好的全局收敛性和稳定性。 |
|---|---|
| AbstractList | 旅行商问题（TSP）是组合优化问题的典型代表,针对TSP的求解提出一种离散型细菌觅食（DBFO）算法。该算法通过结合2-opt算法设计了一种适合处理离散型变量的趋化算子,将细菌觅食算法推广到了离散情形。同时,结合TSP的特点,在迁徙算子中引入基因库的思想来指导新个体的生成,提高了算法的搜索效率。通过对TSPLIB标准库中22个实例进行仿真实验。实验结果表明,该算法能够有效求解城市规模500以下的TSP,与混合蚁群算法和离散型萤火虫群算法相比,具有更好的全局收敛性和稳定性。 TP301.6; 旅行商问题(TSP)是组合优化问题的典型代表,针对TSP的求解提出一种离散型细菌觅食(DBFO)算法.该算法通过结合2-opt算法设计了一种适合处理离散型变量的趋化算子,将细菌觅食算法推广到了离散情形.同时,结合TSP的特点,在迁徙算子中引入基因库的思想来指导新个体的生成,提高了算法的搜索效率.通过对TSPLIB标准库中22个实例进行仿真实验.实验结果表明,该算法能够有效求解城市规模500以下的TSP,与混合蚁群算法和离散型萤火虫群算法相比,具有更好的全局收敛性和稳定性. |
| Author | 王勇臻 陈燕 李桃迎 |
| AuthorAffiliation | 大连海事大学交通运输管理学院,辽宁大连116026 |
| AuthorAffiliation_xml | – name: 大连海事大学交通运输管理学院,辽宁大连,116026 |
| Author_FL | CHEN Yan WANG Yong-zhen LI Tao-ying |
| Author_FL_xml | – sequence: 1 fullname: WANG Yong-zhen – sequence: 2 fullname: CHEN Yan – sequence: 3 fullname: LI Tao-ying |
| Author_xml | – sequence: 1 fullname: 王勇臻 陈燕 李桃迎 |
| BookMark | eNo9jz1Lw1AYhe9Qwbb6J6SDS-J73_sR7yjFLygomD3cfNUEvdEEkayCLhacipsOAbsJ4tjfYxL_hZGK04HDwzk8A9IzmYkIGVGwmZJqJ7WTojA2BaAWk0rYCJTbFG1g2CP9_36dDIoiBeBIFfTJqHlb1vPq6-WxWT60T7N2cf9dvTbvz_XnvP64axeVe3a6QdZifVFEm385JO7Bvjs-siYnh8fjvYkVSEArYI7kMfdDGkLEfAhRU6FAI6NCizgIBAWquNh1lHY0xqh4FCNEvvZBilCyIdlezd5qE2sz9dLsJjfdoZcWaVmW6a8SxU6oQ7dWaHCemel10sFXeXKp89KTEhUyzgX7ATfBW5k |
| ClassificationCodes | TP301.6 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.3969/j.issn.1001-3695.2014.12.032 |
| DatabaseName | 维普期刊资源整合服务平台 中文科技期刊数据库-CALIS站点 中文科技期刊数据库-7.0平台 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | Discrete bacteria foraging optimization algorithm for solving TSP |
| DocumentTitle_FL | Discrete bacteria foraging optimization algorithm for solving TSP |
| EndPage | 3645 |
| ExternalDocumentID | jsjyyyj201412032 662923445 |
| GrantInformation_xml | – fundername: 国家自然科学基金资助项目; 辽宁省科技重大项目; 辽宁省教育厅科学研究一般项目 funderid: (71271034); (2011219009); (L2012173) |
| GroupedDBID | -0Y 2B. 2C0 2RA 5XA 5XJ 92H 92I 92L ACGFS ALMA_UNASSIGNED_HOLDINGS CCEZO CQIGP CUBFJ CW9 TCJ TGT U1G U5S W92 ~WA 4A8 93N ABJNI PSX |
| ID | FETCH-LOGICAL-c602-c3764f4bd1d0e3b0d2a1590a2315a5fcc5101945879a7a2f294ef20ebab065d63 |
| ISSN | 1001-3695 |
| IngestDate | Thu May 29 03:54:50 EDT 2025 Wed Feb 14 10:33:56 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 12 |
| Keywords | discrete bacteria foraging optimization algorithm 离散型细菌觅食优化算法 traveling salesman problem(TSP) 基因库 gene pool 旅行商问题 2-opt |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c602-c3764f4bd1d0e3b0d2a1590a2315a5fcc5101945879a7a2f294ef20ebab065d63 |
| Notes | 51-1196/TP WANG Yong-zhen,CHEN Yan,LI Tao-ying（Transportation Management College, Dalian Maritime University, Dalian Liaoning 116026, China） discrete bacteria foraging optimization algorithm;traveling salesman problem（TSP）;2-opt;gene pool Traveling salesman problem（ TSP） is a typical representative of combinatorial optimization problems. This paper proposed a discrete bacteria foraging optimization（ DBFO） algorithm to tackle the TSP. It desinged a new chemotaxis operator which was combined with 2-opt algorithm so as to handle discrete variables,and it made the bacteria foraging algorithm extend to the discrete situation. With the characteristics of the TSP,it designed a new elimination operator which is combined with gene pool so as to direct the generation of new individuals,which improved the search efficiency. Simulation experiments on22 TSP problems from TSPLIB show that,the proposed algorithm can solve the TSP which city scale is below 500 effectively,and is superior to hybrid ACO and discrete GSO algorithm |
| PageCount | 4 |
| ParticipantIDs | wanfang_journals_jsjyyyj201412032 chongqing_primary_662923445 |
| PublicationCentury | 2000 |
| PublicationDate | 2014 |
| PublicationDateYYYYMMDD | 2014-01-01 |
| PublicationDate_xml | – year: 2014 text: 2014 |
| PublicationDecade | 2010 |
| PublicationTitle | 计算机应用研究 |
| PublicationTitleAlternate | Application Research of Computers |
| PublicationTitle_FL | Application Research of Computers |
| PublicationYear | 2014 |
| Publisher | 大连海事大学交通运输管理学院,辽宁大连,116026 |
| Publisher_xml | – name: 大连海事大学交通运输管理学院,辽宁大连,116026 |
| SSID | ssj0042190 ssib001102940 ssib002263599 ssib023646305 ssib051375744 ssib025702191 |
| Score | 1.9403164 |
| Snippet | ... TP301.6;... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 3642 |
| SubjectTerms | 2-opt 基因库 旅行商问题 离散型细菌觅食优化算法 |
| Title | 离散型细菌觅食算法求解TSP |
| URI | http://lib.cqvip.com/qk/93231X/201412/662923445.html https://d.wanfangdata.com.cn/periodical/jsjyyyj201412032 |
| Volume | 31 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NaxNBFB9iCuLFb7FWJULmVFKzO9_H3XRD8SCCEXoLO_vRkkOqNj2kF0HQi4Kn4k0PBXsTxGP_HpP4X_je7nS7hVLUyzC8-Xozb_a938zOvCGkrWQep4mXdRKbqA5XOevYPIEPL_US4VvGs7w4IPtUbrzgTzbFZqPxpnZqaW9i15L9c--V_I9UgQZyxVuy_yDZqlIgQBzkCyFIGMK_kjGNFA0kDUMaSWoEDRiNBDUR1SEmAV1LGmmq-1T3MBIoqgWNDOY0_aJ4RI3C4iHDGjDiUe27zAEbPH9Wx68FPaKBd6as6dEwwKYhNByTIAx0kafrKIGhYbULiARdsikw1KpgE1leRfaMobooDiQjVos21rEERKBtzTB7CL2K6rsW5T1Rp2LxEBeT5dOaJzrYWQI31_yaRmWy9L7lrDP-NT1P8zMjTaH5sY21qg08u8eL_V63i3rWt7aUPgBczsUlsuQr5YkmWQrC9bB_iigBgNU9DProvOd0BYfu92VNZeKbgGADKpUpPKZE8cBACQ44JJYOMhyDl0nbcf_4It7R88f2znjrFeCZ4nrZOI_HWzUkNLhOrrolTCso5-MN0tjfvkmunTwP0nLW4hZpz78dzw4Of335MD9-v_j0cXH07vfh1_n3z7OfB7MfbxdHhzC5bpNBPxr0NjruUY5OIsF4JmCQeM5t6qXdjNlu6scAiLsxLBNELPIkQR1vuNDKxCr2cxi8LPe7mY0tgN1UsjukOd4ZZ3dJSyap9lRutWUxBxQZA5q0eSpBaRiW22yZrFR9Hr4sfa8MK4ktk0duFIbui9wdjnZH0-l0hOPm-TBq9y6sYYVcwZzlftp90py83sseAMKc2IduFvwBGU9Zpw |
| linkProvider | EBSCOhost |
| 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%3Ajournal&rft.genre=article&rft.atitle=%E7%A6%BB%E6%95%A3%E5%9E%8B%E7%BB%86%E8%8F%8C%E8%A7%85%E9%A3%9F%E7%AE%97%E6%B3%95%E6%B1%82%E8%A7%A3TSP&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%BA%94%E7%94%A8%E7%A0%94%E7%A9%B6&rft.au=%E7%8E%8B%E5%8B%87%E8%87%BB+%E9%99%88%E7%87%95+%E6%9D%8E%E6%A1%83%E8%BF%8E&rft.date=2014&rft.issn=1001-3695&rft.volume=31&rft.issue=12&rft.spage=3642&rft.epage=3645&rft_id=info:doi/10.3969%2Fj.issn.1001-3695.2014.12.032&rft.externalDocID=662923445 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F93231X%2F93231X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjyyyj%2Fjsjyyyj.jpg |