Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning
-
Updated
Oct 20, 2020 - Python
Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning
How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.
GraphLab is an application that shows visually how several graph algorithms work
Implementation of the paper A Genetic Algorithm for a Green Vehicle Routing Problem
The research work on local search algorithms
A Travelling Salesman Problem (TSP) solver using a hybrid of strategies
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?
Traveling Salesman Problem, UAV simulation using 2-OPT heuristic algorithm
Competitive C++ solution to the Travelling Salesperson 2D problem, that includes the implementation of 6 algorithms: greedy, Clarke-Wright, Christofides, 2-opt, 3-opt, and Lin-Kernighan (k-opt). Done as part of the project assignment in the *DD22440 Advanced Algorithms* course at KTH, by Prof. Danupon Nanongkai.
A Python package for visualizing graph algorithms.
Vehicle Routing Problem optimization with Genetic Algorithm
Multi-storey Vehicle Routing Problem optimization using Iterated Local Search
A simple Quadratic Assignment Problem solver using heuristics and metaheuristics
Algorithms Project for Oregon State University
Assignments of Artificial Intelligence Sessional Course CSE 318 in Level-3, Term-2 of CSE, BUET
Discrete and continuous optimization problems solved iteratively and approximately by metaheuritic algorithms.
implementation of constructive and improvement heuristics for the Travelling Salesman Problem
Projects of Course
Add a description, image, and links to the 2-opt topic page so that developers can more easily learn about it.
To associate your repository with the 2-opt topic, visit your repo's landing page and select "manage topics."