This study aims to solve the traveling salesman problem for small, medium, and large
traveling salesman problems taken from the TSPLIB with known solutions, by using an …

Many real world industrial applications involve the Traveling Salesman Problem (TSP),
which is a problem that finds a Hamiltonian path with minimum cost. Examples of problems …

The purpose of this paper is to present a new hierarchic method based on swarm
intelligence algorithms for solving the well-known traveling salesman problem. The swarm …

The traveling salesman problem (TSP) has been a popular problem studied in the
optimization field for a long time. The most successful methods used in solving these difficult …

Artificial bee colony (ABC) is a quite popular optimization approach that has been used in
many fields, with its not only standard form but also improved versions. In this paper, new …

By combining the modified nearest neighbor approach and the improved inver-over
operation, an Artificial Bee Colony (ABC) Algorithm for Traveling Salesman Problem (TSP) is …

Travelling salesman problem (TSP) is a fundamental combinatorial optimization model
studied in the operations research community for nearly half a century. It belongs to the class …

In this research paper, Artificial Bee Colony algorithm is modified with multiple update rules
and K-opt operation to solve the Traveling Salesman Problem. Here the features of swap …

Combinatorial optimization finds the best subset in a discrete problem space. In engineering
or management fields, many problems are formulated as a combinatorial optimization …

Combinatorial optimization problems are usually NP-hard and the solution space of them is
very large. Therefore the set of feasible solutions cannot be evaluated one by one. Artificial …