Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing, Ant Colony Optimization Algorithm,Immune Algorithm, Artificial Fish Swarm Algorithm, Differential Evolution and TSP(Traveling salesman)

Adaptive large neighbourhood search (and more!) in Python.

Code for the paper 'An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem' (INFORMS Annual Meeting Session 2019)

Some lecture notes of Operations Research (usually taught in Junior year of BS) can be found in this repository along with some Python programming codes to solve numerous problems of Optimization including Travelling Salesman, Minimum Spanning Tree and so on.

A 2D/3D visualization of the Traveling Salesman Problem main heuristics

Visualisation of Simulated Annealing algorithm to solve TSP

A Genetic Algorithm in Python for the Travelling Salesman Problem

A Python implementation of the Ant Colony Optimization Meta-Heuristic

Python implementation for TSP using Genetic Algorithms, Simulated Annealing, PSO (Particle Swarm Optimization), Dynamic Programming, Brute Force, Greedy and Divide and Conquer

Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning

elkai is a Python library for solving travelling salesman problems (TSP) based on LKH 3

This is my implementation of a branch and price algorithm to solve the humanitarian aid distribution problem. This problem is a VRP with a specific objective function

Defund the Police.

Python implementation of Travelling Salesman Problem (TSP) using branch-and-bound algorithm.

A genetic algorithm implementation in python

Solver for Capacitance Vehicle Routing Problem - School bus routing problem with bus stop selection

Solving tsp (travel sales problem) using ruin & recreate method.

Genetic algorithms are heuristic search algorithms inspired by the process that supports the evolution of life. The algorithm is designed to replicate the natural selection process to carry generation, i.e. survival of the fittest of beings.

Contains code meant to optimize the route for a tourist visiting the Louvre Museum, such that the satisfaction level is maximised by visiting all/select exhibits in a single working day.