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 条
  • [1] TSP Problem Based on Artificial Ant Colony Algorithm
    Li, Jin-Ze
    Liu, Wei-Xing
    Han, Yang
    Xing, Hong-Wei
    Yang, Ai-Min
    Pan, Yu-Hang
    LECTURE NOTES IN REAL-TIME INTELLIGENT SYSTEMS (RTIS 2016), 2018, 613 : 196 - 202
  • [2] Order picking problem based on ant colony algorithm
    Liu, Chen-Qi
    Li, Mei-Juan
    Chen, Xue-Bo
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2009, 29 (03): : 179 - 185
  • [3] Assignment Problem Based on Improved Ant Colony Algorithm
    Geo, Zhi'e
    Zhang, Gongjing
    RECENT TRENDS IN MATERIALS AND MECHANICAL ENGINEERING MATERIALS, MECHATRONICS AND AUTOMATION, PTS 1-3, 2011, 55-57 : 356 - 360
  • [4] An Approximate Algorithm for the Steiner Tree Problem based on Ant Colony Algorithm
    Jia, Jingwei
    Long, Haiming
    2ND INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING, INFORMATION SCIENCE AND INTERNET TECHNOLOGY, CII 2017, 2017, : 262 - 267
  • [5] Design of Ant Colony - based algorithm Ant Route for solve the OSPF problem
    Tupia Anticona, Manuel
    Estrada Villegas, Carina
    CERMA 2007: ELECTRONICS, ROBOTICS AND AUTOMOTIVE MECHANICS CONFERENCE, PROCEEDINGS, 2007, : 386 - +
  • [6] An improved ant colony algorithm based on Vehicle Routing Problem
    Pan, Tinglei
    Pan, Haipeng
    Gao, Jingfei
    2015 34TH CHINESE CONTROL CONFERENCE (CCC), 2015, : 2747 - 2752
  • [7] VLSI Placement Problem Based on Ant Colony Optimization Algorithm
    Zaruba, Daria
    Zaporozhets, Dmitry
    Kureichik, Vladimir
    ARTIFICIAL INTELLIGENCE PERSPECTIVES IN INTELLIGENT SYSTEMS, VOL 1, 2016, 464 : 127 - 133
  • [8] Traveling salesman problem based on improved ant colony algorithm
    Zhang Hui
    Wang Xi-huai
    Xiao Jian-mei
    Proceedings of the 2007 Chinese Control and Decision Conference, 2007, : 492 - +
  • [9] Solving Path Planning Problem Based on Ant Colony Algorithm
    Ming, Kong
    2017 29TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2017, : 5391 - 5395
  • [10] Traveling agent problem based on ant colony optimization algorithm
    Zhu, Shanhong, 1600, Sila Science, University Mah Mekan Sok, No 24, Trabzon, Turkey (32):
12345