On the public citation graph

Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem

0 signed · 51 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-1-4419-1153-7_1068openalex-snapshot
Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-319-02141-6_4openalex-snapshot
Improved and Discrete Cuckoo Search for Solving the Travelling Salesman Problem
inferredcites →https://doi.org/10.1007/b101971openalex-snapshot
The Traveling Salesman Problem and Its Variations
inferredcites →https://doi.org/10.1007/s00521-013-1402-2openalex-snapshot
Discrete cuckoo search algorithm for the travelling salesman problem
inferredcites →https://doi.org/10.1007/s10489-006-0018-yopenalex-snapshot
Genetic operators for combinatorial optimization in TSP and microarray gene ordering
inferredcites →https://doi.org/10.1007/s10489-009-0179-6openalex-snapshot
Study on hybrid PS-ACO algorithm
inferredcites →https://doi.org/10.1007/s12597-012-0086-1openalex-snapshot
Neighborhood reduction strategy for tabu search implementation in asymmetric traveling salesman problem
inferredcites →https://doi.org/10.1016/0304-3975(77)90012-3openalex-snapshot
The Euclidean travelling salesman problem is NP-complete
inferredcites →https://doi.org/10.1016/0377-2217(92)90138-yopenalex-snapshot
The traveling salesman problem: An overview of exact and approximate algorithms
inferredcites →https://doi.org/10.1016/j.asoc.2011.01.039openalex-snapshot
Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search
inferredcites →https://doi.org/10.1016/j.camwa.2011.06.063openalex-snapshot
Memetic Algorithm based on Improved Inver–over operator and Lin–Kernighan local search for the Euclidean traveling salesman problem
inferredcites →https://doi.org/10.1016/j.compstruc.2010.06.011openalex-snapshot
Optimum design of skeletal structures using imperialist competitive algorithm
inferredcites →https://doi.org/10.1016/j.engappai.2010.10.001openalex-snapshot
An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering
inferredcites →https://doi.org/10.1016/j.eswa.2010.04.081openalex-snapshot
Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm
inferredcites →https://doi.org/10.1016/j.eswa.2010.07.006openalex-snapshot
Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms
inferredcites →https://doi.org/10.1016/j.eswa.2011.04.163openalex-snapshot
Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques
inferredcites →https://doi.org/10.1016/j.eswa.2011.04.241openalex-snapshot
A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties
inferredcites →https://doi.org/10.1016/j.eswa.2011.10.012openalex-snapshot
Solving the traveling salesman problem using cooperative genetic ant systems
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.ipl.2007.03.010openalex-snapshot
Particle swarm optimization-based algorithms for TSP and generalized TSP
inferredcites →https://doi.org/10.1016/j.isatra.2012.09.008openalex-snapshot
A robust PID controller based on imperialist competitive algorithm for load-frequency control of power systems
inferredcites →https://doi.org/10.1016/j.physa.2011.06.070openalex-snapshot
Improved extremal optimization for the asymmetric traveling salesman problem
inferredcites →https://doi.org/10.1016/j.pnsc.2008.01.030openalex-snapshot
Solving traveling salesman problems using generalized chromosome genetic algorithm
inferredcites →https://doi.org/10.1080/00207160.2012.758362openalex-snapshot
New Imperialist Competitive Algorithm to solve the travelling salesman problem
inferredcites →https://doi.org/10.1080/00207540903536155openalex-snapshot
A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop 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.4425083openalex-snapshot
Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition
inferredcites →https://doi.org/10.1109/cso.2011.46openalex-snapshot
A New Design of Genetic Algorithm for Solving TSP
inferredcites →https://doi.org/10.1142/s0218213010000200openalex-snapshot
BEE COLONY OPTIMIZATION WITH LOCAL SEARCH FOR 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.15837/ijccc.2013.3.7openalex-snapshot
Improved ACO Algorithm with Pheromone Correction Strategy for the Traveling Salesman Problem
inferredcites →https://doi.org/10.24297/ijct.v10i3.3269openalex-snapshot
Genetic algorithm based approach to solve travelling salesman problem with one point crossover operator:
inferredcites →https://doi.org/10.5860/choice.45-0928openalex-snapshot
The Traveling salesman problem: a computational study

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-030-54621-2_262-1openalex-snapshot
Heuristic and Metaheuristic Algorithms for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-981-10-0287-8_5openalex-snapshot
Ant Colony Optimization Meta-heuristic for Solving Real Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/s00500-018-3281-zopenalex-snapshot
Multi-period mean–semivariance portfolio optimization based on uncertain measure
inferred← citeshttps://doi.org/10.1007/s00521-016-2557-4openalex-snapshot
Performance prediction of circular saw machine using imperialist competitive algorithm and fuzzy clustering technique
inferred← citeshttps://doi.org/10.1016/b978-0-12-819714-1.00020-8openalex-snapshot
Traveling salesman problem: a perspective review of recent research and new results with bio-inspired metaheuristics
inferred← citeshttps://doi.org/10.1016/b978-0-12-822830-2.00007-6openalex-snapshot
Unmanned driving intelligent algorithm simulation platform
inferred← citeshttps://doi.org/10.1016/j.cie.2022.108075openalex-snapshot
Improved discrete imperialist competition algorithm for order scheduling of automated warehouses
inferred← citeshttps://doi.org/10.1016/j.jtbi.2015.12.002openalex-snapshot
3D protein structure prediction using Imperialist Competitive algorithm and half sphere exposure prediction
inferred← citeshttps://doi.org/10.1109/hora49412.2020.9152916openalex-snapshot
Imperialist Competitive Algorithm with Independence and Constrained Assimilation
inferred← citeshttps://doi.org/10.1109/icmic.2017.8321633openalex-snapshot
Improved imperialist competitive algorithm for flexible flow shop scheduling
inferred← citeshttps://doi.org/10.1109/icmic.2017.8321635openalex-snapshot
Feature selection for risk detection of strokes: A 5-year longitudinal study
inferred← citeshttps://doi.org/10.1109/inaes.2016.7821917openalex-snapshot
Operational optimization of binary distillation column to achieve product quality using Imperialist Competitive Algorithm (ICA)
inferred← citeshttps://doi.org/10.1109/isacv.2018.8354075openalex-snapshot
Efficient spark-based framework for solving the traveling salesman problem using a distributed swarm intelligence method
inferred← citeshttps://doi.org/10.1142/s0218213018500057openalex-snapshot
Imperialist Competitive Algorithm with Updated Assimilation for the Solution of Real Valued Optimization Problems
inferred← citeshttps://doi.org/10.24003/emitter.v7i2.380openalex-snapshot
An Efficient Solution to Travelling Salesman Problem using Genetic Algorithm with Modified Crossover Operator
inferred← citeshttps://doi.org/10.3390/a16020091openalex-snapshot
Redesigning the Wheel for Systematic Travelling Salesmen
inferred← citeshttps://doi.org/10.3390/a8030407openalex-snapshot
Implementation of a Parallel Algorithm Based on a Spark Cloud Computing Platform
inferred← citeshttps://doi.org/10.4018/ijec.307131openalex-snapshot
Application Research of IICA Algorithm in a Limited-Buffer Scheduling Problem
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.