Témák listája

The problem states that the traveling salesman needs to visit a certain number of cities to sell objects and then return to the starting point. The salesman tries to find the shortest Hamiltonian cycle of the graph. The task is to study and investigate the development of the meta-heuristic algorithm (prefer DBMEA) to get better results. Programing skills are required.