A population based stochastic algorithm for solving the Traveling Salesman Problem.
-
Updated
Feb 14, 2017 - Java
A population based stochastic algorithm for solving the Traveling Salesman Problem.
Working on the Multiple Choice Knapsack Problem to design optimal packet schedulers for 5G data rates. (Jan - Feb 2020)
A two armed bandit simulation and comparison with theoritical convergence
A robust public transport routing engine for the SBB network guaranteeing arrival times based on statistical confidence levels (Q%). Built with PySpark, Trino, and a custom stochastic multi-criteria Dijkstra algorithm.
To associate your repository with the stochastic-algorithm topic, visit your repo's landing page and select "manage topics."