On the public citation graph
A gene-pool based genetic algorithm for TSP
0 signed · 22 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.1007/978-3-662-02830-8openalex-snapshot
Genetic Algorithms + Data Structures = Evolution Programs
inferredcites →https://doi.org/10.1007/bf01589105openalex-snapshot
New lower bounds for the Symmetric Travelling Salesman Problem
inferredcites →https://doi.org/10.1007/bfb0032050openalex-snapshot
Local optimization and the Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/0377-2217(83)90161-3openalex-snapshot
The symmetric traveling salesman problem and edge exchanges in minimal 1-trees
inferredcites →https://doi.org/10.1109/4235.974843openalex-snapshot
A hybrid heuristic for the traveling salesman problem
inferredcites →https://doi.org/10.1109/icec.1996openalex-snapshot
Proceedings of IEEE International Conference on Evolutionary Computation
inferredcites →https://doi.org/10.1109/icec.1997.592288openalex-snapshot
Genetic local search for the TSP: new results
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-85984-0_21openalex-snapshot
A Parallel Multi-algorithm Solver for Dynamic Multi-Objective TSP (DMO-TSP)
inferred← citeshttps://doi.org/10.1109/cec.2003.1299769openalex-snapshot
Solving dynamic TSP with evolutionary approach in real time
inferred← citeshttps://doi.org/10.1109/cec.2004.1331070openalex-snapshot
A hybrid evolutionary algorithm for traveling salesman problem
inferred← citeshttps://doi.org/10.1109/cec.2008.4630839openalex-snapshot
Multi-algorithm co-evolution strategy for Dynamic Multi-Objective TSP
inferred← citeshttps://doi.org/10.1109/icbnmt.2013.6823904openalex-snapshot
An improved simulated annealing andgenetic algorithm for TSP
inferred← citeshttps://doi.org/10.1109/icmlc.2004.1382208openalex-snapshot
An approach to dynamic traveling salesman problem
inferred← citeshttps://doi.org/10.1109/icnc.2007.23openalex-snapshot
A Fast Evolutionary Algorithm for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/icnc.2007.433openalex-snapshot
Immune Algorithms for Multi-solution Based on Partition and Local Recombination
inferred← citeshttps://doi.org/10.1109/wcica.2004.1341994openalex-snapshot
TSP problem based on dynamic environment
inferred← citeshttps://doi.org/10.14257/ijca.2017.10.2.16openalex-snapshot
An Improved Particle Swarm Optimization Algorithm for Traveling Salesman Problems
inferred← citeshttps://doi.org/10.36347/sjet.2022.v10i05.002openalex-snapshot
Parallel Genetic Algorithm Based on Construction of Gene Pool in the Ordinary Network for TSP
inferred← citeshttps://doi.org/10.4028/www.scientific.net/aef.6-7.290openalex-snapshot
Orthogonal Genetic Algorithm and its Application in Traveling Salesman Problem
inferred← citeshttps://doi.org/10.5772/12949openalex-snapshot
A Fast Evolutionary Algorithm for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.5772/547openalex-snapshot
Traveling Salesman Problem, Theory and Applications
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.