Abstract

Ant Colony Optimization has achieved good results in solving Traveling Salesman Problem (TSP), it has a tendency to fall into local optima and the convergence speed is limited. To address this problem, multi-colony ant colony optimization based on the generalized Jaccard similarity recommendation strategy (JCACO) is proposed. Firstly, two classical ant populations, Ant Colony System and Max-Min Ant System are selected to form heterogeneous multi-colony. Secondly, attribute-based collaborative filtering recommendation mechanism is proposed to balance the diversity and convergence of the algorithm, three strategies have been implemented under this recommendation mechanism: The attribute cross-learning strategy is used to highlight the effect of excellent attributes and improve the attribute comprehensive performance; According to the diversity results of the population measured by information entropy, the attribute recommendation learning strategy is used to enrich the diversity of the population adaptively; The pheromone reward strategy is implemented on the public path to accelerate the convergence speed; Among which, according to the generalized Jaccard similarity coefficient, the most suitable communication object is recommended in order to achieve the best learning efficiency. Finally, when the algorithm stagnates, the elite reverse learning mechanism is used to jump out of the local optimum. Experimental results show that JCACO has good performance and high stability in TSP instances, especially in large-scale TSP instances.

Highlights

  • Traveling Salesman Problem (TSP) is one of the famous NP-hard problems, which refers to the shortest path problem that a traveler starts from a certain starting point, passes all the given demand points, and each demand point only passes once, returns to the starting point

  • Ant colony algorithm has been successfully applied in several fields, the most successful of which is used for combinatorial optimization problems, the ant colony optimization proposed in this paper adopts the TSP problem for experimental testing

  • This paper proposes a multi-colony ant colony optimization based on the generalized Jaccard similarity recommendation strategy, s1 Ant Colony System (ACS) subpopulations and s2 Max-Min Ant System (MMAS) subpopulations are selected to form heterogeneous multi-colony, the diversity and convergence speed of the algorithm are balanced

Read more

Summary

INTRODUCTION

TSP is one of the famous NP-hard problems, which refers to the shortest path problem that a traveler starts from a certain starting point, passes all the given demand points, and each demand point only passes once, returns to the starting point. The existing multi-colony algorithm balances the diversity and convergence of the algorithm and reflecting the advantages of the multi-colony algorithm, the interaction strategy between populations is relatively simple, and the adaptability of the algorithm needs to be improved To solve these problems, some scholars have introduced the principle of recommendation system into ant colony optimization and adopted interdisciplinary methods to make the direction of the improvement more clear. Where ξ is global pheromone evaporation coefficient, Cbs is the length of the global optimal path; τibjs is the pheromone added to the global optimal path, its expression is formula (6)

MAX-MIN ANT SYSTEM
ATTRIBUTE-BASED COLLABORATIVE FILTERING RECOMMENDATION MECHANISM
ALGORITHM FRAMEWORK The following is the execution process of JCACO: Step1
21 End-While
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call