A Hybrid PSO-GA Algorithm for Traveling Salesman Problems in Different Environments

摘要

In this study particle swarm optimization (PSO) is modified and hybridised with genetic algorithm (GA) using one's output as the other's input to solve Traveling Salesman Problem(TSP). Here multiple velocity update rules are introduced to modify the PSO and at the time of the movement of a solution, one rule is selected depending on its performances using roulette wheel selection process. Each velocity update rule and the corresponding solution update rule are defined using swap sequence (SS) and swap operation (SO). K-Opt operation is applied in a regular interval of iterations for the movement of any stagnant solution. GA is applied on the final output swarm of the PSO to search the optimal path of the large size TSPs. Roulette wheel selection process, multi-point cyclic crossover and the K-opt operation for the mutation are used in the GA phase. The algorithm is tested in crisp environment using different size benchmark test problems available in the TSPLIB. In the crisp environment the algorithm gives approximately 100% success rate for the test problems up to considerably large sizes. Efficiency of the algorithm is tested with some other existing algorithms in the literature using Friedman test. Some approaches are incorporated with this algorithm for finding solutions of the TSPs in imprecise (fuzzy/rough) environment. Imprecise problems are generated from the crisp problems randomly, solved and obtained results are discussed. It is observed that the performance of the proposed algorithm is better compared to the some other algorithms in the existing literature with respect to the accuracy and the consistency for the symmetric TSPs as well as the Asymmetric TSPs.