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

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.

Computational intelligence and neuroscience - 1 Jan 2017

Hussain Abid, Muhammad Yousaf Shad, Nauman Sajid M, Hussain Ijaz, Mohamd Shoukry Alaa, Gani Showkat

Abstract excerpt

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Biological Evolution

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Computer Simulation

Share to Crossing Over, Genetic

Share to Models, Genetic

Share to Mutation

Share to Software

Share to Stochastic Processes

Source

Open in PubMed Open full text

Identifiers

PMID: 29209364
DOI: 10.1155/2017/7430125
PMCID: PMC5676484

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 5 Sept 2026. Manifest publication-graph-cohort-2026-09-05.1.

Source receipt: pubmed, retrieved 5 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.PMID 29209364Read ↗

Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm.Semantic proximity Read ↗

Genetic Programming with Tabu List for Dynamic Flexible Job Shop Scheduling.Semantic proximity Read ↗

An Effective Evolutionary Hybrid for Solving the Permutation Flowshop Scheduling Problem.Semantic proximity Read ↗

On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem.Semantic proximity Read ↗

Beautiful Mind: a meta-heuristic algorithm for generating minimal covering arraySemantic proximity Read ↗

Novel hybrid genetic algorithm for progressive multiple sequence alignment.Semantic proximity Read ↗

A tri-level fortification model for edge protection against intentional attacks in the capacitated vehicle routing problemSemantic proximity Read ↗

A graph-based evolutionary algorithm: Genetic Network Programming (GNP) and its extension using reinforcement learning.Semantic proximity Read ↗

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

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

RGFGA: an efficient representation and crossover for grouping genetic algorithms.Semantic proximity Read ↗

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

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