Travelling salesman problem (TSP) is a prominent computational problem where trail
technique is used to calculate all the possible travel and choose the best one. Since there is …

This paper investigates the systematic and complete usage of k-opt permutations with k= 2…
6 in application to local optimization of symmetric two-dimensional instances up to 10 7 …

Minimum latency problem (MLP) is an NP-Hard combinatorial optimization problem.
Metaheuristics use perturbation and randomization to arrive at a satisfactory solution under …

This paper presents the novel GPU-based parallel strategy for the heuristic algorithms to
solve the large-scale Capacited Vehicle Routing Problem (CVRP). A combination of five …

The Traveling Salesman Problem has often been used as an exploration ground for building
heuristics to calculate the shortest path of a complete graph that traverse every vertex …