A fine-grained fast parallel genetic algorithm based on a ternary optical computer for solving traveling salesman problem
Published 2022 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
A fine-grained fast parallel genetic algorithm based on a ternary optical computer for solving traveling salesman problem
Authors
Keywords
-
Journal
JOURNAL OF SUPERCOMPUTING
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2022-09-30
DOI
10.1007/s11227-022-04813-9
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Theoretical basis and implementation mechanism of the programming platform for ternary optical computer
- (2022) Shuang Li et al. IEEE Access
- Dynamic Analysis and FPGA Implementation of New Chaotic Neural Network and Optimization of Traveling Salesman Problem
- (2021) Li Cui et al. COMPLEXITY
- Design and Implementation of Walsh-Hadamard Transform on Ternary Optical Computer
- (2021) wang zhehe et al. APPLIED OPTICS
- Design and implementation of bitwise parallel MSD square rooting in ternary optical computer
- (2021) Zhehe Wang et al. OPTICAL ENGINEERING
- Improvement of Traveling Salesman Problem Solution Using Hybrid Algorithm Based on Best-Worst Ant System and Particle Swarm Optimization
- (2021) Muhammad Salman Qamar et al. Applied Sciences-Basel
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- (2020) Pouya Baniasadi et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- The application of SJ-MSD adder to mean value filtering processing
- (2020) Jiang Jiabao et al. OPTIK
- An efficient parallel genetic algorithm solution for vehicle routing problem in cloud implementation of the intelligent transportation systems
- (2020) Mahdi Abbasi et al. Journal of Cloud Computing-Advances Systems and Applications
- Design and implementation of a three-lane CA Traffic Flow model on ternary optical computer
- (2020) Sulan Zhang et al. OPTICS COMMUNICATIONS
- An Arable Field for Benchmarking of Metaheuristic Algorithms for Capacitated Coverage Path Planning Problems
- (2020) Erfan Khosravani Moghadam et al. Agronomy-Basel
- A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
- (2018) Kin-Ming Lo et al. International Journal of Computational Intelligence Systems
- On computational complexity of the constructive-optimizer neural network for the traveling salesman problem
- (2018) Mahdi Saadatmand-Tarzjan NEUROCOMPUTING
- Dynamic programming approaches for the traveling salesman problem with drone
- (2018) Paul Bouman et al. NETWORKS
- An Improved Genetic Algorithm with Initial Population Strategy for Symmetric TSP
- (2015) Yong Deng et al. MATHEMATICAL PROBLEMS IN ENGINEERING
- Principles and construction of MSD adder in ternary optical computer
- (2010) Yi Jin et al. Science China-Information Sciences
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now