On the public citation graph
Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
0 signed · 29 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1965.tb04146.xopenalex-snapshot
Computer Solutions of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/bf00197287openalex-snapshot
Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/bf00202901openalex-snapshot
An evolutionary approach to the traveling salesman problem
inferredcites →https://doi.org/10.1007/bf00203625openalex-snapshot
The “molecular” traveling salesman
inferredcites →https://doi.org/10.1007/bf00339943openalex-snapshot
“Neural” computation of decisions in optimization problems
inferredcites →https://doi.org/10.1038/317804a0openalex-snapshot
Optimization strategies gleaned from biological evolution
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/1026105openalex-snapshot
The N -City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
inferredcites →https://doi.org/10.1287/mnsc.26.5.495openalex-snapshot
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot
Adaptation in Natural and Artificial Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6440(200105)84:5<13::aid-ecjc2>3.0.co;2-hopenalex-snapshot
A proposal of a greedy-GA combined algorithm for data transfer binding problems
inferred← citeshttps://doi.org/10.1007/3-540-58484-6_261openalex-snapshot
Selection schemes with spatial isolation for genetic optimization
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_43openalex-snapshot
Dynamical System Approaches to Combinatorial Optimization∗
inferred← citeshttps://doi.org/10.1007/978-1-4471-1599-1_146openalex-snapshot
Introducing a Clustering Technique into Recurrent Neural Networks for Solving Large-Scale Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_18openalex-snapshot
Dynamical System Approaches to Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/bf00199469openalex-snapshot
Genetic algorithm with local optimization
inferred← citeshttps://doi.org/10.1007/s004220050423openalex-snapshot
State-space search strategies gleaned from animal behavior: a traveling salesman experiment
inferred← citeshttps://doi.org/10.1016/j.sysarc.2025.103447openalex-snapshot
BQProfit: Budget and QoS aware task offloading and resource allocation for Profit maximization under MEC platform
inferred← citeshttps://doi.org/10.1080/10020070312331343280openalex-snapshot
Solving traveling salesman problems by genetic algorithms
inferred← citeshttps://doi.org/10.1109/icec.1998.700158openalex-snapshot
A new metric function and harmonic crossover for symmetric and asymmetric traveling salesman problems
inferred← citeshttps://doi.org/10.1109/icsmc.1998.724995openalex-snapshot
An improved genetic algorithm using the convex hull for traveling salesman problem
inferred← citeshttps://doi.org/10.1109/mspct.2009.5164164openalex-snapshot
Genetic algorithm for Traveling Salesman Problem: Using modified Partially-Mapped Crossover operator
inferred← citeshttps://doi.org/10.1541/ieejeiss1987.118.12_1778openalex-snapshot
Distance Based Construction of Genetic Algorithm
inferred← citeshttps://doi.org/10.4018/ijisscm.2014010105openalex-snapshot
Review of Solution Approaches for the Symmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.9746/sicetr1965.31.598openalex-snapshot
A Method for the Traveling Salesman Problem Based on the Genetic Algorithm
inferred← citeshttps://doi.org/10.9746/sicetr1965.33.939openalex-snapshot
A Genetic Solution for the Traveling Salesman Problem by Means of a Thermodynamical Selection Rule
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.