On the public citation graph

Modified Simulated Annealing Hybrid Algorithm to Solve the Traveling Salesman Problem

https://doi.org/10.1109/codit55151.2022.9804145

0 signed · 26 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-319-91446-6_33openalex-snapshot

Effective Algorithm of Simulated Annealing for the Symmetric Traveling Salesman Problem

inferredcites →https://doi.org/10.1007/s00500-012-0855-zopenalex-snapshot

A novel two-stage hybrid swarm intelligence optimization algorithm and application

inferredcites →https://doi.org/10.1007/s12532-009-0004-6openalex-snapshot

General k-opt submoves for the Lin–Kernighan TSP heuristic

inferredcites →https://doi.org/10.1016/j.eswa.2017.01.053openalex-snapshot

Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem

inferredcites →https://doi.org/10.1016/j.ins.2008.12.016openalex-snapshot

A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem

inferredcites →https://doi.org/10.1016/j.physa.2021.126067openalex-snapshot

A thorough study of the performance of simulated annealing in the traveling salesman problem under correlated and long tailed spatial scenarios

inferredcites →https://doi.org/10.1063/1.1699114openalex-snapshot

Equation of State Calculations by Fast Computing Machines

inferredcites →https://doi.org/10.1109/access.2019.2945570openalex-snapshot

Enhanced List-Based Simulated Annealing Algorithm for Large-Scale Traveling Salesman Problem

inferredcites →https://doi.org/10.1109/ams.2008.27openalex-snapshot

A Bee Colony Optimization Algorithm for Traveling Salesman Problem

inferredcites →https://doi.org/10.1109/cec.2007.4424894openalex-snapshot

A novel discrete particle swarm optimization to solve traveling salesman problem

inferredcites →https://doi.org/10.1109/wci.2015.7495512openalex-snapshot

Comparison and analysis of solving travelling salesman problem using GA, ACO and hybrid of ACO with GA and CS

inferredcites →https://doi.org/10.1155/2016/1712630openalex-snapshot

List-Based Simulated Annealing Algorithm for Traveling Salesman Problem

inferredcites →https://doi.org/10.1155/2021/6668345openalex-snapshot

Solving the Traveling Salesman Problem: A Modified Metaheuristic Algorithm

inferredcites →https://doi.org/10.1287/ijoc.3.4.376openalex-snapshot

TSPLIB—A Traveling Salesman Problem Library

inferredcites →https://doi.org/10.1287/opre.2.4.393openalex-snapshot

Solution of a Large-Scale Traveling-Salesman Problem

inferredcites →https://doi.org/10.1287/opre.4.1.61openalex-snapshot

The Traveling-Salesman Problem

inferredcites →https://doi.org/10.1287/opre.6.6.791openalex-snapshot

A Method for Solving Traveling-Salesman Problems

inferredcites →https://doi.org/10.29207/resti.v5i6.3549openalex-snapshot

Numerical Approach of Symmetric Traveling Salesman Problem Using Simulated Annealing

inferredcites →https://doi.org/10.2991/ijcis.d.200117.001openalex-snapshot

New Ant Colony Optimization Algorithm for the Traveling Salesman Problem

inferredcites →https://doi.org/10.3390/info10010007openalex-snapshot

Traveling-Salesman-Problem Algorithm Based on Simulated Annealing and Gene-Expression Programming

inferredcites →https://doi.org/10.4236/oalib.1107520openalex-snapshot

Repetitive Nearest Neighbor Based Simulated Annealing Search Optimization Algorithm for Traveling Salesman Problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4666187openalex-extracted

Optimizing Decisions in Vehicle Routing Problems Using Deep Reinforcement Learning: Overview And Systematic Review

inferred← citeshttps://doi.org/10.1109/icaccs57279.2023.10112798openalex-snapshot

Ant Colony Optimization with Simulated Annealing Algorithm for Google Maps

inferred← citeshttps://doi.org/10.1115/1.4066660openalex-snapshot

A Modified Simulated Annealing-Based Method for Hybrid Lattice Support Structure Design in LPBF Additive Manufacturing

inferred← citeshttps://doi.org/10.17798/bitlisfen.1380086openalex-snapshot

Comparison of New and Old Optimization Algorithms for Traveling Salesman Problem on Small, Medium, and Large-scale Benchmark Instances

inferred← citeshttps://doi.org/10.3390/math13183050openalex-snapshot

A Deep Reinforcement Learning Model to Solve the Stochastic Capacitated Vehicle Routing Problem with Service Times and Deadlines

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.