Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Alipour, Mir Mohammada; * | Abdolhosseinzadeh, Mohsenb
Affiliations: [a] Department of Computer Engineering, University of Bonab, Bonab, Iran | [b] Department of Mathematics, Faculty of Basic Science, University of Bonab, Bonab, Iran
Correspondence: [*] Corresponding author: Mir Mohammad Alipour, Department of Computer Engineering, University of Bonab, Bonab, Iran. E-mail: [email protected].
Abstract: The Maximum Independent Set Problem (MISP) consists of finding the largest subset of vertices of a graph such that none of the vertices are adjacent. It is well known that the MISP is an NP-Complete problem and usually cannot be solved exactly within a reasonable amount of time. In recent years, various heuristic search techniques, such as tabu search, genetic algorithm, simulated annealing, ant colony optimization and neural network algorithms have been used to solve this problem. In this paper, we propose a new algorithm for the MISP using Multiagent Reinforcement Learning (MARL) approach. In the proposed approach, each agent tries to solve MISP autonomously and improves its local behavior using reinforcement learning (RL) and directly communicates with other agents by sharing successful results. Also, the Exchange 2-1 local search is used to further improvement of the solutions at each step. The experiments were carried out on DIMACS clique instances and p-random graphs. Our experimental results show that the proposed approach is able to compete or even outperform some state-of-the-art algorithms.
Keywords: Maximum independent set problem, multiagent systems (MAS), reinforcement learning, Q-learning; exchange 2-1 local search, maximum clique problem (MCP)
DOI: 10.3233/MGS-200323
Journal: Multiagent and Grid Systems, vol. 16, no. 1, pp. 101-115, 2020
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]