An Improved Ant Colony Algorithm for Multi-Attribute Stable Bilateral Matching Problem

With the increasing popularity and development of e-commerce and information technology, multi-attribute bilateral matching problem has been receiving more and more attention. In this paper, multi-attribute bilateral matching problem is discussed based on the consideration of stable matching. Concepts and definitions of multi-attribute bilateral stable matching are presented firstly, followed by the definitions and sorting rules of the matching extent. Subsequently evaluation functions and evaluation rules for the stable matching results are proposed, and then an improved state transition strategy and an improved pheromone update strategy, which are suitable for this problem, are introduced. Based on the above-mentioned preparation, this paper presents an improved ant colony algorithm, and the simulation results demonstrate that the algorithm can solve the traditional stable matching problem, and is also effective in the multi-attribute bilateral stable matching problem solving.