New Variable Neighborhood Search Structure for Travelling Salesman Problems
A. Hande Erol Bingüler & Serol Bulkan · Journal of Advances in Mathematics and Computer Science · 2015
In the traveling salesman problem, there are a collection of cities and travel cost between each pair of them. The aim is to find the minimum cost way of visiting all cities and returning to the starting point. This kind of problem is deceptive and one of the most intensely studi...
Open access
Research Article
10.9734/BJMCS/2015/14453