There are 2 repositories under 2-opt topic.
Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning
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
Traveling Salesman Problem, UAV simulation using 2-OPT heuristic algorithm
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?
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.
Multi-storey Vehicle Routing Problem optimization using Iterated Local Search
Projects of Course
Algorithms Project for Oregon State University
Podium at Artificial Intelligence Cup 2022 - USI
Crappy Windows forms application for visualizing 2opt.NET results.
implementation of constructive and improvement heuristics for the Travelling Salesman Problem
2-opt python library implemented in c
Discrete and continuous optimization problems solved iteratively and approximately by metaheuritic algorithms.
Assignments of Artificial Intelligence Sessional Course CSE 318 in Level-3, Term-2 of CSE, BUET
Code from seminars and homework, second year in the university
Discrete Optimization Algorithms
Python implementation of heuristics for the TSP.
TSP visualizer that uses Genetic algorithm with different parameters
2-opt algorithm approach to solving Traveling Salesperson.
Qt Application to solve the TSP problem using TSPLIB instances and applied in Google Maps, through hybridization of GRASP and VNS metaheuristics
Implementation of Hill Climbing algorithm to Traveling Salesman Problem
Solving the traveling salesman problem using the Gurobi Solver, the farthest insertion algorithm, the nearest neighbor algorithm and, finally, using the 2-opt optimization method.
Traveling Salesman Problem Solver using Nearest Neighbor and 2-OPT Algorithm.
Implementing travelling salesman in python