Skip to content

Latest commit

 

History

History
18 lines (12 loc) · 921 Bytes

README.md

File metadata and controls

18 lines (12 loc) · 921 Bytes

TSPVisualizationFX

Traveling Salesman Problem Using Genetic Algorithm and JavaFX.

How to run

By clicking on screen you will create new City(Circle) and by hitting space the algorithm will start to wok and show you the solution
To make the solution better you just need to hit space again

  • Space: Run the PSO Algorithm
  • Ctrl+Space: Run the Genetic Algorithm

Refrences

1 - Kang-Ping Wang, Lan Huang, Chun-Guang Zhou and Wei Pang (2003). Particle swarm optimization for traveling salesman problem. Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

2 - Mukhairez, H. and Maghari, A. (2015). Performance Comparison of Simulated Annealing, GA and ACO Applied to TSP. International Journal of Intelligent Computing Research, 6(4), pp.647-654.

Screenshot

TSP