Skip to content

This project compares genetic algorithms (GA), particle swarm optimization (PSO), ant colony optimization (ACO), and Transformer-based algorithms, and discusses which algorithm is more suitable for solving airport problems.

Notifications You must be signed in to change notification settings

Kimsale/TSP_contrast

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

TSP_contrast

This project compares genetic algorithms (GA), particle swarm optimization (PSO), ant colony optimization (ACO), and Transformer-based algorithms, and discusses which algorithm is more suitable for solving airport problems.

Based on experiments, we believe that simple scenarios with less than 50 nodes are suitable for GA algorithms, dynamically changing environments are suitable for ACO algorithms, and complex constraints with 200+ nodes are suitable for Transformer-based algorithms. Different algorithms can be selected for TSP problems according to different situations.

About

This project compares genetic algorithms (GA), particle swarm optimization (PSO), ant colony optimization (ACO), and Transformer-based algorithms, and discusses which algorithm is more suitable for solving airport problems.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published