Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm.

Computational intelligence and neuroscience - 1 Jan 2022

Liu Guangjun, Xu Xiaoping, Wang Feng, Tang Yangli

Abstract excerpt

The traveling salesman problem is a typical NP hard problem and a typical combinatorial optimization problem. Therefore, an improved artificial cooperative search algorithm is proposed to solve the traveling salesman problem. For the basic artificial collaborative search algorithm, firstly, the sigmoid function is used to construct the scale factor to enhance the global search ability of the algorithm; secondly,...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Mutation
Share to Problem Solving

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Travel

Source

Open in PubMed Open full text

Identifiers

PMID: 35463281
DOI: 10.1155/2022/1008617
PMCID: PMC9019308

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 6 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm.PMID 35463281Read ↗

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.Semantic proximity Read ↗

A Guided Quantum Particle Swarm Optimization Approach for the Traveling Repairman ProblemSemantic proximity Read ↗

Constrained evolutionary optimization by means of (μ + λ)-differential evolution and improved adaptive trade-off model.Semantic proximity Read ↗

A Novel Hybrid Clonal Selection Algorithm with Combinatorial Recombination and Modified Hypermutation Operators for Global Optimization.Semantic proximity Read ↗

An adaptive Cauchy differential evolution algorithm for global numerical optimization.Semantic proximity Read ↗

Subpopulation Particle Swarm Optimization with a Hybrid Mutation Strategy.Semantic proximity Read ↗

A Dynamic Adaptive Weighted Differential Evolutionary Algorithm.Semantic proximity Read ↗

International Trade Path with Multi-Polarization based on Multidirectional Mutation Genetic Algorithm Enabled Neural Network.Semantic proximity Read ↗

Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.Semantic proximity Read ↗

A novel hybrid PSO based on levy flight and wavelet mutation for global optimization.Semantic proximity Read ↗

A υ-Constrained Matrix Adaptation Evolution Strategy With Broyden-Based Mutation for Constrained Optimization.Semantic proximity Read ↗

An Adaptive Memetic Algorithm for the Joint Allocation of Heterogeneous Stochastic Resources.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.