Skip to content

OPTTSP is a Java framework for use and implementation of heuristics and metaheuristics.

License

Notifications You must be signed in to change notification settings

FlavioLandes/OPTTSP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 

Repository files navigation

OPTTSP

OPTTSP is a Java framework for the use and implementation of heuristics and metaheuristics for the Traveling Salesman Problem (symmetric and asymmetric). For use, it provides a set of implemented heuristics and meta-heuristics. Already for the implementation, it offers a whole structure to collaborate in this process.

Implemented methods

Constructive heuristics:

  • Nearest Neighbor;
  • Random.

Local Search heuristics:

  • Random Descent Method.

Metaheuristics:

  • Iterated Local Search;
  • GRASP (Greedy Randomized Adaptive Search Procedure);
  • Multi-Start.

Usage

The OPTTSP framework allows to use the heuristics and metaheuristics already implemented, as well as to implement new heuristics and metaheuristics. For more details, please look at OPTTSP/src/main/java/example.

Author

Flávio Barreiro Landes

E-mail: landesflavio@gmail.com

License

OPTTSP uses MIT License.

Releases

No releases published

Packages

No packages published

Languages