Traveling Salesman Problem + JAVA

Download source code @ https://sites.fastspring.com/prototypeprj/instant/ai

Recursive Brute Force

• Solving TSP + Recursive Brute Force + JAVA (Prototype Project 01)

  • Brute Force Algorithm used here to solve TSP

  • Each city is identified by its latitude & longitude coordinates

  • Haversine formula used for calculating distances between cities

• TSP + Brute Force Algorithm + SQLite DB + JAVA (Prototype Project 02)

  • Refactor Prototype Project 01, add DB + file storage & retrieval functionality

Simulated Annealing

• Solving TSP + Simulated Annealing + JAVA (Prototype Project 01)

  • Simulated Annealing Algorithm used here to solve TSP

  • Each city is identified by its latitude & longitude coordinates

  • Haversine formula used for calculating distances between cities

• TSP + Simulated Annealing + SQLite DB + JAVA (Prototype Project 02)

  • Refactor Prototype Project 01, add DB + file storage & retrieval functionality

Ant Colony Optimization

• TSP + ACO + JAVA (Prototype Project 01)

  • ACO Algorithm used here to solve TSP

  • Each city is identified by its latitude & longitude coordinates

  • Haversine formula used for calculating distances between cities

• TSP + ACO + SQLite DB + JAVA (Prototype Project 02)

  • Refactor Prototype Project 01, add DB + file storage & retrieval functionality

Nearest Neighbor

• Solving TSP + Nearest Neighbor + JAVA (Prototype Project 01)

  • Nearest Neighbor Algorithm used here to solve TSP

  • Each city is identified by its latitude & longitude coordinates

  • Haversine formula used for calculating distances between cities

• TSP + Nearest Neighbor + SQLite DB + JAVA (Prototype Project 02)

  • Refactor Prototype Project 01, add DB + file storage & retrieval functionality

Hill Climbing

• Solving TSP + Hill Climbing + JAVA (Prototype Project 01)

  • Hill Climbing Algorithm used here to solve TSP

  • Each city is identified by its latitude & longitude coordinates

  • Haversine formula used for calculating distances between cities

• TSP + Hill Climbing + SQLite DB + JAVA (Prototype Project 02)

  • Refactor Prototype Project 01, add DB + file storage & retrieval functionality

Random Restart Hill Climbing

• Solving TSP + Random Restart Hill Climbing + JAVA (Prototype Project 01)

  • Random Restart Hill Climbing Algorithm used here to solve TSP

  • Each city is identified by its latitude & longitude coordinates

  • Haversine formula used for calculating distances between cities

• TSP + Random Restart Hill Climbing + SQLite DB + JAVA (Prototype Project 02)

  • Refactor Prototype Project 01, add DB + file storage & retrieval functionality