TY - GEN
T1 - An improved ant colony algorithm for multiattribute stable bilateral matching problem
AU - Liu, Yongqiang
AU - Chang, Qing
AU - Xiong, Huagang
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
KW - Ant colony algorithm (ACO)
KW - Bipartite matching
KW - Multi-attribute
KW - Stable matching
UR - https://www.scopus.com/pages/publications/78650977017
U2 - 10.1109/LEITS.2010.5665025
DO - 10.1109/LEITS.2010.5665025
M3 - 会议稿件
AN - SCOPUS:78650977017
SN - 9781424487783
T3 - 2010 International Conference on Logistics Engineering and Intelligent Transportation Systems, LEITS2010 - Proceedings
SP - 84
EP - 87
BT - 2010 International Conference on Logistics Engineering and Intelligent Transportation Systems, LEITS2010 - Proceedings
T2 - 2010 International Conference on Logistics Engineering and Intelligent Transportation Systems, LEITS2010
Y2 - 26 November 2010 through 28 November 2010
ER -