I'm an A.I enthusiast and quant. I have created a TSP solver which provides optimal paths for up to 30 nodes. I'm an A.I enthusiast and quant. I have created a TSP ...

An optimized genetic algorithm engine for solving large-scale Travelling Salesman Problem instances with custom mutation, crossover, and hyper-parameter tuning.

In this video, I demonstrate how I trained an AI to play the classic game of Snake Martin Short's daughter Katherine Short dies at 42 Dozens of Democrats to boycott Trump's State of the Union address ...

Pull requests help you collaborate on code with other people. As pull requests are created, they’ll appear here in a searchable and filterable list. To get started, you should create a pull request.

The Traveling Salesman Problem (TSP), a quintessential challenge in computational theory, involves finding the shortest route that visits each city exactly once before returning to the starting point.

1 Energy, Materials and Methods Research Laboratory, National High Polytechnic School of Douala, Douala, Cameroon. 2 National Advanced School of Engineering, University of Yaounde I, Yaounde, Cameroon ...

Abstract: Optimization problem is which mainly focuses on finding feasible solution out of all possible solutions. Travelling salesman problem belongs to this one. As it is not possible to find its ...

Abstract: In this paper, a novel hybrid genetic algorithm for solving Traveling Salesman Problem (TSP) is presented based on the Nearest Neighbor heuristics and pure Genetic Algorithm (GA). The hybrid ...