Ant colony based algorithm for stable marriage problem

被引：7
|
作者：
Vien, Ngo Anh [1 ]
Viet, Nguyen Hoang [1 ]
Kim, Hyun [1 ]
Lee, SeungGwan
Chung, TaeChoong [1 ]
机构：
[1] Kyung Hee Univ, Sch Elect & Informat, Dept Comp Engn, Artificial Intelligence Lab, Seoul, South Korea
来源：
ADVANCES AND INNOVATIONS IN SYSTEMS, COMPUTING SCIENCES AND SOFTWARE ENGINEERING | 2007年
关键词：
D O I：
10.1007/978-1-4020-6264-3_79
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper introduces ant colony system (ACS), a distributed algorithm that is applied to the Stable Marriage Problem (SM). The stable marriage problem is an extensively-studied combinatorial problem with many practical applications. It is well known that at least one stable matching exists for every stable marriage instance. However, the classical Gale-Shapley [2] algorithm produces a marriage that greatly favors the men at the expense of the women, or vice versa. In our proposed ACS, a set of cooperating agents called ants cooperate to find stable matchings such as stable matching with man-optimal, woman-optimal, egalitarian stable matching, sex-fair stable matching. So this ACS is a novel method to solve Stable Marriage Problem. Our simulation results show the effectiveness of the proposed ACS.
引用
收藏
页码：457 / +
页数：2
相关论文
共 50 条
  • [41] Behavior of the ant colony algorithm for the set covering problem
    Alexandrov, D
    Kochetov, Y
    OPERATIONS RESEARCH PROCEEDINGS 1999, 2000, : 255 - 260
  • [42] A Modified Ant Colony Algorithm for Vehicle Routing Problem
    Yu, Shanshan
    Xiang, Xiaolin
    EBM 2010: INTERNATIONAL CONFERENCE ON ENGINEERING AND BUSINESS MANAGEMENT, VOLS 1-8, 2010, : 2631 - 2635
  • [43] Development of an Algorithm for Solving an Asymmetric Routing Problem Based on the Ant Colony Method
    S. Rakhmetullina
    G. Zhomartkyzy
    Iu. Krak
    A. Kamelova
    Cybernetics and Systems Analysis, 2023, 59 : 526 - 534
  • [44] Vehicle Routing Problem Research Based on Genetic-ant Colony Algorithm
    Zhang Liangzhi
    Hou Yimeng
    Li Peide
    2008 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2008, : 1946 - +
  • [45] Ant colony algorithm based on hybrid behavior apply to traveling salesman problem
    Hu, XB
    Huang, XY
    WAVELET ANALYSIS AND ITS APPLICATIONS, AND ACTIVE MEDIA TECHNOLOGY, VOLS 1 AND 2, 2004, : 583 - 588
  • [46] Hybrid ant colony algorithm based on vehicle routing problem with time windows
    Zhu, Yuhua
    Zhen, Tong
    2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 50 - 53
  • [47] Ant colony algorithm based on solving strongly heterogeneous container loading problem
    Business College of Shanxi University, Shanxi, China
    Metall. Min. Ind., 5 (331-338):
  • [48] Solution to 0/1 knapsack problem based on improved ant colony algorithm
    Shi Han-xiao
    Proceedings of 2005 Chinese Control and Decision Conference, Vols 1 and 2, 2005, : 955 - +
  • [49] Min-max vehicle routing problem based on ant colony algorithm
    Liu, Xia
    Yang, Chao
    Jiefangjun Ligong Daxue Xuebao/Journal of PLA University of Science and Technology (Natural Science Edition), 2012, 13 (03): : 336 - 341
  • [50] Ant colony optimization-based algorithm for airline crew scheduling problem
    Deng, Guang-Feng
    Lin, Woo-Tsong
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (05) : 5787 - 5793
12345