On the public citation graph
Particle Swarm Optimization Algorithm for the Traveling Salesman Problem
0 signed · 71 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/9781119584445.ch10openalex-snapshot
The Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/0-306-48213-4_9openalex-snapshot
Experimental Analysis of Heuristics for the STSP
inferredcites →https://doi.org/10.1007/3-211-27389-1_61openalex-snapshot
A hybrid particle swarm optimization model for the traveling salesman problem
inferredcites →https://doi.org/10.1007/978-3-540-39930-8_8openalex-snapshot
Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/b101971openalex-snapshot
The Traveling Salesman Problem and Its Variations
inferredcites →https://doi.org/10.1007/bfb0040810openalex-snapshot
Parameter selection in particle swarm optimization
inferredcites →https://doi.org/10.1007/s11721-007-0002-0openalex-snapshot
Particle swarm optimization
inferredcites →https://doi.org/10.1016/s0377-2217(98)00099-xopenalex-snapshot
Guided local search and its application to the traveling salesman problem
inferredcites →https://doi.org/10.1016/s0377-2217(99)00284-2openalex-snapshot
An effective implementation of the Lin–Kernighan traveling salesman heuristic
inferredcites →https://doi.org/10.1080/00207540310001614150openalex-snapshot
Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization
inferredcites →https://doi.org/10.1080/00401706.2000.10486067openalex-snapshot
Practical Nonparametric Statistics
inferredcites →https://doi.org/10.1109/cec.1999.785513openalex-snapshot
The swarm and the queen: towards a deterministic and adaptive particle swarm optimization
inferredcites →https://doi.org/10.1109/cec.2000.870279openalex-snapshot
Comparing inertia weights and constriction factors in particle swarm optimization
inferredcites →https://doi.org/10.1109/cec.2001.934374openalex-snapshot
Particle swarm optimization: developments, applications and resources
inferredcites →https://doi.org/10.1109/cec.2006.1688339openalex-snapshot
Particle Swarm Optimization for the Bi-objective Degree constrained Minimum Spanning Tree
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/cit.2004.1357292openalex-snapshot
Fuzzy discrete particle swarm optimization for solving traveling salesman problem
inferredcites →https://doi.org/10.1109/ical.2007.4338736openalex-snapshot
Chaotic Particle Swarm Optimization Algorithm for Traveling Salesman Problem
inferredcites →https://doi.org/10.1109/icmlc.2004.1382191openalex-snapshot
Modified particle swarm optimization based on space transformation for solving traveling salesman problem
inferredcites →https://doi.org/10.1109/icsmc.1997.637339openalex-snapshot
A discrete binary version of the particle swarm algorithm
inferredcites →https://doi.org/10.1109/sis.2003.1202275openalex-snapshot
Swarm intelligence for permutation optimization: a case study of n-queens problem
inferredcites →https://doi.org/10.1109/tevc.2004.826067openalex-snapshot
Handling multiple objectives with particle swarm optimization
inferredcites →https://doi.org/10.1145/357318.357320openalex-snapshot
Particle Systems—a Technique for Modeling a Class of Fuzzy Objects
inferredcites →https://doi.org/10.1287/ijoc.15.3.233.16078openalex-snapshot
Tour Merging via Branch-Decomposition
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the 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.1007/978-3-031-09835-2_4openalex-snapshot
Advances on Particle Swarm Optimization in Solving Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-24866-5_31openalex-snapshot
Fitness Landscape Ruggedness Impact on PSO in Dealing with Three Variants of the Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-97554-7_19openalex-snapshot
Structural Limiting Range of Perception in Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-39384-1_42openalex-snapshot
Use of Different Movement Mechanisms in Cockroach Swarm Optimization Algorithm for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-24282-3_7openalex-snapshot
Routing on a Spherical Surface Using Hybrid PSO
inferred← citeshttps://doi.org/10.1007/978-3-642-34707-8_51openalex-snapshot
A Hybrid Discrete Particle Swarm Optimization with Pheromone for Dynamic Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-40495-5_72openalex-snapshot
Efficient DPSO Neighbourhood for Dynamic Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/s00500-017-2738-9openalex-snapshot
Adjustability of a discrete particle swarm optimization for the dynamic TSP
inferred← citeshttps://doi.org/10.1007/s00521-019-04132-wopenalex-snapshot
A conceptual comparison of several metaheuristic algorithms on continuous optimisation problems
inferred← citeshttps://doi.org/10.1007/s10489-017-0982-4openalex-snapshot
An exploratory study of mono and multi-objective metaheuristics to ensemble of classifiers
inferred← citeshttps://doi.org/10.1007/s10845-020-01653-3openalex-snapshot
Genetic algorithm based approaches to solve the order batching problem and a case study in a distribution center
inferred← citeshttps://doi.org/10.1007/s11227-021-03744-1openalex-snapshot
A novel state transition simulated annealing algorithm for the multiple traveling salesmen problem
inferred← citeshttps://doi.org/10.1007/s11277-020-07480-2openalex-snapshot
Heuristic Relay-Node Selection in Opportunistic Network Using RNN-LSTM Based Mobility Prediction
inferred← citeshttps://doi.org/10.1007/s42452-020-2073-0openalex-snapshot
Nature-inspired metaheuristic techniques for automatic clustering: a survey and performance study
inferred← citeshttps://doi.org/10.1016/j.eswa.2012.05.090openalex-snapshot
Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime
inferred← citeshttps://doi.org/10.1016/j.tre.2018.10.006openalex-snapshot
Optimization of the multi-objective green cyclical inventory routing problem using discrete multi-swarm PSO method
inferred← citeshttps://doi.org/10.1038/s41524-020-0286-9openalex-snapshot
An automated predictor for identifying transition states in solids
inferred← citeshttps://doi.org/10.1051/e3sconf/202671604001openalex-snapshot
An Efficient PSO-Based Approach for Optimizing Internal Gain Schedules in Building Energy Simulation
inferred← citeshttps://doi.org/10.1080/0305215x.2018.1431232openalex-snapshot
Multi-objective feasibility enhanced particle swarm optimization
inferred← citeshttps://doi.org/10.1109/ait49014.2019.9144908openalex-snapshot
Adapted Gravitational Search Algorithm Using Multiple Populations to Solve Exam Timetable Scheduling Problems
inferred← citeshttps://doi.org/10.1109/apeie.2018.8546185openalex-snapshot
On Problems and Algorithm of Clustering and Constructing Optimal Routes by Speed Criterion
inferred← citeshttps://doi.org/10.1109/bracis.2019.00064openalex-snapshot
A Comparative Study on Automatic Model and Hyper-Parameter Selection in Classifier Ensembles
inferred← citeshttps://doi.org/10.1109/ccpqt64497.2024.00039openalex-snapshot
PSO-GA with Dynamic Coefficients for Solving the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/discover47552.2019.9008062openalex-snapshot
A Framework To Study Heuristic TSP Algorithms With Google Maps API
inferred← citeshttps://doi.org/10.1109/eict.2014.6777868openalex-snapshot
Velocity Tentative Particle Swarm Optimization to solve TSP
inferred← citeshttps://doi.org/10.1109/icacci.2016.7732022openalex-snapshot
Edge-PSO: A recombination operator based PSO algorithm for solving TSP
inferred← citeshttps://doi.org/10.1109/iccce.2012.6271164openalex-snapshot
Particle Swarm Optimization with partial search to solve Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/icecocs50124.2020.9314375openalex-snapshot
The Ant-Step Algorithms: Reloading the Ant System Heuristic and the Overlooked Basic Variants
inferred← citeshttps://doi.org/10.1109/icocs.2014.7060983openalex-snapshot
Discrete bat-inspired algorithm for travelling salesman problem
inferred← citeshttps://doi.org/10.1109/icsecs.2015.7333089openalex-snapshot
A comparative study of African Buffalo Optimization and Randomized Insertion Algorithm for asymmetric Travelling Salesman's Problem
inferred← citeshttps://doi.org/10.1109/tencon50793.2020.9293747openalex-snapshot
Development of a Vehicle Routing System for Delivery Services
inferred← citeshttps://doi.org/10.1109/wcccs.2014.7107914openalex-snapshot
Discrete cat swarm optimization algorithm applied to combinatorial optimization problems
inferred← citeshttps://doi.org/10.1155/int/8918171openalex-snapshot
DPSO‐Q: A Reinforcement Learning–Enhanced Swarm Algorithm for Solving the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1177/0954406216681593openalex-snapshot
Feasibility enhanced particle swarm optimization for constrained mechanical design problems
inferred← citeshttps://doi.org/10.13140/rg.2.1.1171.8009openalex-snapshot
A GENETIC SIMPLIFIED SWARM ALGORITHM FOR OPTIMIZING n- CITIES OPEN LOOP TRAVELLING SALESMAN PROBLEM
inferred← citeshttps://doi.org/10.17212/1727-2769-2016-3-83-97openalex-snapshot
Problems and optimization algorithms of parallel-serial systems schedules with undefined service routes
inferred← citeshttps://doi.org/10.17706/jcp.13.10.1185-1191openalex-snapshot
Solving Location Problem of Distribution Center Based on Hybrid Particle Swarm Algorithm
inferred← citeshttps://doi.org/10.2478/jaiscr-2025-0004openalex-snapshot
Portfolio Optimization with Translation of Representation for Transport Problems
inferred← citeshttps://doi.org/10.25130/tjaes.18.60.1.35openalex-snapshot
A hybrid algorithm to bypass some weak features in the particle swarm and firefly algorithms...with an application to the traveling salesman problem
inferred← citeshttps://doi.org/10.30880/jscdm.2023.04.02.007openalex-snapshot
Comparative Analysis for Test Case Prioritization Using Particle Swarm Optimization and Firefly Algorithm
inferred← citeshttps://doi.org/10.3390/math11092092openalex-snapshot
Autonomous Multi-UAV Path Planning in Pipe Inspection Missions Based on Booby Behavior
inferred← citeshttps://doi.org/10.3390/math13111704openalex-snapshot
Optimizing Route Planning via the Weighted Sum Method and Multi-Criteria Decision-Making
inferred← citeshttps://doi.org/10.4018/978-1-7998-5442-5.ch005openalex-snapshot
Metaheuristics Approaches for the Travelling Salesman Problem on a Spherical Surface
inferred← citeshttps://doi.org/10.54684/ijmmt.2022.14.3.299openalex-snapshot
A NEW PSO-BASED ALGORITHM FOR AN OPERATIONAL MANAGEMENT PROBLEM
inferred← citeshttps://doi.org/10.9734/bjmcs/2015/14453openalex-snapshot
New Variable Neighborhood Search Structure for Travelling Salesman Problems
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.