Skip to content

jpruente92/OR-Metaheuristics

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

OR-Metaheuristics

Implementation of different heuristics and metaheuristics in Java for the Traveling Salesman Problem. Covered algorithms:

  • Nearest Neighbor
  • Ant Colony
  • Simulated Annealing
  • Tabu Search

The code can be easily extended to solve different settings e.g. for the Simulated Annealing algorithm it is just necessary to provide problem specific functions for evaluating a solution, computing a start solution and computing a neighbor solution. Some tests suggest that Simulated Annealing and Tabu Search outperform the Ant Colony algorithm for this setting but there are various hyperparameters that can be tuned.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages