A fine-grained fast parallel genetic algorithm based on a ternary optical computer for solving traveling salesman problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A fine-grained fast parallel genetic algorithm based on a ternary optical computer for solving traveling salesman problem

Published:2022-09-30 Issue:5 Volume:79 Page:4760-4790
ISSN:0920-8542
Container-title:The Journal of Supercomputing
language:en
Short-container-title:J Supercomput

Author:

Wang Zhehe,Shen Yunfu^ORCID,Li Shuang,Wang Shuxin

Funder

National Natural Science Foundation of China

Hainan Higher Education Reform Research Project of China

Hainan Provincial Natural Science Foundation of China

University-level general research project of Shanghai Normal University of China

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Information Systems,Theoretical Computer Science,Software

Link

https://link.springer.com/content/pdf/10.1007/s11227-022-04813-9.pdf

Reference46 articles.

1. Karp RM, Miller RE, Thatcher JW, Bohlinger JD (1972) Reducibility among combinatorial problems. Springer, Boston

2. Beame P, Cook S, Edmonds J, Impagliazzo R, Pitassi T (1998) The relative complexity of np search problems. J Computer Syst Sci 57(1):3–19. https://doi.org/10.1006/jcss.1998.1575

3. Baniasadi P, Foumani M, Smith-Miles K, Ejov V (2020) A transformation technique for the clustered generalized traveling salesman problem with applications to logistics. Eur J Op Res 285(2):444–457. https://doi.org/10.1016/j.ejor.2020.01.053

4. Khosravani Moghadam E, Vahdanjoo M, Jensen AL, Sharifi M, Sørensen CAG (2020) An arable field for benchmarking of metaheuristic algorithms for capacitated coverage path planning problems. Agronomy 10(10):1454. https://doi.org/10.3390/agronomy10101454

5. Wang Z, Mumtaz J, Zhang L, Yue L (2019) Application of an improved spider monkey optimization algorithm for component assignment problem in pcb assembly. Procedia CIRP 83:266–271. https://doi.org/10.1016/j.procir.2019.04.075

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel RSA encryption algorithm based on a ternary optical computer;Applied Optics;2024-08-23

2. Adaptive region algorithm based on a ternary optical computer;Applied Optics;2024-06-11

3. Solving Traveling Salesman Problem Using Parallel River Formation Dynamics Optimization Algorithm on Multi-core Architecture Using Apache Spark;International Journal of Computational Intelligence Systems;2024-01-03

4. High capacity NP-Complete problems solver based on dual-comb asynchronous optical sampling;Optics Communications;2024-01

5. Design and implementation of a parallel OTSU algorithm based on a ternary optical computer;Applied Optics;2023-12-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3