PhuocSang16/CS106.N21

This is a course project for Artificial Intelligence of UIT. The selected topic is Using Genetic Algorithm for Traveling Theif Problem.

/ 100

Experimental

No commits in the last 6 months.

No License Stale 6m No Package No Dependents

Maintenance 0 / 25

Adoption 2 / 25

Maturity 8 / 25

Community 0 / 25

Stars

Forks

—

Language

Jupyter Notebook

License

—

Category

Last pushed

Sep 19, 2023

Commits (30d)

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/PhuocSang16/CS106.N21"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.

Higher-rated alternatives

pdrm83/py2opt

How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.

aimclub/SAMPO

Open-source framework for adaptive manufacturing processes scheduling

yining043/TSP-improve

An improvement-based Deep Reinforcement Learning Algorithm presented in paper...

albert-espin/knapsack-packing

Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)

rithinch/pareto-optimal-student-supervisor-allocation

🎓An AI tool to assist universities with optimal allocation of students to supervisors for their...