Discrete novel hybrid particle swarm optimization to solve travelling salesman problem

Metaheuristics is a set of intelligent nature inspired method, it aims to solve some optimization problems, such as quadratic assignment problem, knapsack problem, and graph colouring problem. Resolving an optimization problem consist in applying a mathematic process to find the minimum or the maximum solution depending on the constraints of the problem. In this paper, the travelling salesman problem is chosen to test the performance of a new proposed discrete novel hybrid particle swarm optimization. This method presents a combination between particle swarm optimization and harmony search algorithm, where harmony search improved the swarm. An experimental result of a different methaheuristics shows the efficiency of the proposed method for solving some benchmarks instances of TSPLib.