Optimized Routing for Electric Delivery Vehicles

SANNet Neural Network Framework

A simple Travelling Salesman Problem to solve (optimize) with Java and IBM Cplex - For Learning Purposes

SEAGE (Search Agents) is a hyper-heuristic framework for metaheuristic collaboration.

Travelling Salesman Problem, solved with a modification of the Traditional Depth First Search

Travelling Salesman Problem solved in Java

Creating solutions to the Travelling Salesman Problem with Java

A drone air-quality mapping system. The drone's movement is constrained to moving in fixed increments, and only angles of 10. The system retrieves drone air-quality stations, and no-fly-zones as Geo-JSON objects from a webserver. The system then uses these to find an optimal route to pass through all the stations without going into any no-fly-zones

Traveling Salesman Problem Solver using Nearest Neighbor and 2-OPT Algorithm.

Implementations of DAA Algorithms in various languages

Solving TSP with metaheuristic and exact algorithms.

The Travelling Salesman Problem (T.S.P) customized to work with the Smart Bin Dashboard application.

Builder of minimal time routes for delivery service. This is my Bachelor thesis in computer science at Ufa SATU on genetic algorithms for solving Travelling Salesman Problem.

Implementation of Simulated Annealing searching algorithm

Winning entry for a programming competition

The travelling-salemsan-problem Java implementation

M1 Project - Solving the TSP