Skip to content

Latest commit

 

History

7 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

TSP-PSO

PSO Algorithm for Travelling Salesman Problem

This repository contains an implementation of a Particle Swarm Optimization (PSO) algorithm for solving the Travelling Salesman Problem (TSP) in C#. The algorithm uses a position-based ranking approach to guide the search.

Requirements

This implementation was written in C# and requires .NET Core 3.1 or higher to run.

References

  • Kennedy, J., & Eberhart, R. (1995, November). Particle swarm optimization. In International conference on neural networks (pp. 1942-1948). IEEE.
  • Yuhui Shi, Russell Eberhart. "A modified particle swarm optimizer", Evolutionary Computation, 1998.

About

Basic PSO using position based ranking to solve TSP

Topics

Resources

Stars

1 star

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages