In accordance with regulations and requirements, the editorial department's website domain has been changed to arocmag.cn. The original domain (arocmag.com) will be discontinued after Dec. 31st, 2024.
See More
Algorithm Research & Explore
|
App. Res. of Comp. Printed Article
Vol. 41, 2024 No. 9
2722-2731

Novel binary artificial bee colony algorithm for solving weighted set covering problem

Sun Feia
He Yichaoa,b,c
Zhang Hansonga
Li Minglianga,c
Wang Linaa
Gao Zexiana
a. College of Information Technology, b. Hebei Key Laboratory of Optoelectronic Information & Geo-detection Technology, c. Intelligent Sensor Network Engineering Research Center of Hebei Province, Hebei GEO University, Shijiazhuang 050031, China
DOI: 10.19734/j.issn.1001-3695.2024.01.0015

Abstract

The weighted set covering problem(WSCP) is a famous NP-hard problem. In order to solve the WSCP efficiently by using artificial bee colony algorithm(ABC), this paper proposed a novel binary ABC(nBABC). In nBABC, it proposed a global evolution operator which combined random learning and inheritance to improve the global exploration ability of the algorithm. Secondly, based on the dynamic adjustment strategy, it proposed an adaptive random inversion operator to maintain the balance between exploration and development. Based on the idea of approximate algorithm, it proposed the repair algorithm WSCP-GRA and optimization algorithm WSCP-GOA for dealing with the infeasible solution of WSCP, on the basis of which a new method for solving WSCP was given by using nBABC. In order to verify the efficiency of nBABC in solving WSCP, using it to solve 45 WSCP instances in OR-Library. The comparison with several algorithms shows that nBABC can obtain the optimal values of all instances, which is more competitive than the existing algorithms for solving WSCP.

Foundation Support

河北省自然科学基金资助项目(F2020403013)
河北省高等学校科学技术研究项目(ZD2021016)
河北省重点研发计划资助项目(22375415D)
河北省研究生创新能力培养资助项目(CXZZSS2014109)

Publish Information

DOI: 10.19734/j.issn.1001-3695.2024.01.0015
Publish at: Application Research of Computers Printed Article, Vol. 41, 2024 No. 9
Section: Algorithm Research & Explore
Pages: 2722-2731
Serial Number: 1001-3695(2024)09-022-2722-10

Publish History

[2024-05-11] Accepted Paper
[2024-09-05] Printed Article

Cite This Article

孙菲, 贺毅朝, 张寒崧, 等. 基于新颖二进制人工蜂群算法求解带权集合覆盖问题 [J]. 计算机应用研究, 2024, 41 (9): 2722-2731. (Sun Fei, He Yichao, Zhang Hansong, et al. Novel binary artificial bee colony algorithm for solving weighted set covering problem [J]. Application Research of Computers, 2024, 41 (9): 2722-2731. )

About the Journal

  • Application Research of Computers Monthly Journal
  • Journal ID ISSN 1001-3695
    CN  51-1196/TP

Application Research of Computers, founded in 1984, is an academic journal of computing technology sponsored by Sichuan Institute of Computer Sciences under the Science and Technology Department of Sichuan Province.

Aiming at the urgently needed cutting-edge technology in this discipline, Application Research of Computers reflects the mainstream technology, hot technology and the latest development trend of computer application research at home and abroad in a timely manner. The main contents of the journal include high-level academic papers in this discipline, the latest scientific research results and major application results. The contents of the columns involve new theories of computer discipline, basic computer theory, algorithm theory research, algorithm design and analysis, blockchain technology, system software and software engineering technology, pattern recognition and artificial intelligence, architecture, advanced computing, parallel processing, database technology, computer network and communication technology, information security technology, computer image graphics and its latest hot application technology.

Application Research of Computers has many high-level readers and authors, and its readers are mainly senior and middle-level researchers and engineers engaged in the field of computer science, as well as teachers and students majoring in computer science and related majors in colleges and universities. Over the years, the total citation frequency and Web download rate of Application Research of Computers have been ranked among the top of similar academic journals in this discipline, and the academic papers published are highly popular among the readers for their novelty, academics, foresight, orientation and practicality.

Indexed & Evaluation

  • The Second National Periodical Award 100 Key Journals
  • Double Effect Journal of China Journal Formation
  • the Core Journal of China (Peking University 2023 Edition)
  • the Core Journal for Science
  • Chinese Science Citation Database (CSCD) Source Journals
  • RCCSE Chinese Core Academic Journals
  • Journal of China Computer Federation
  • 2020-2022 The World Journal Clout Index (WJCI) Report of Scientific and Technological Periodicals
  • Full-text Source Journal of China Science and Technology Periodicals Database
  • Source Journal of China Academic Journals Comprehensive Evaluation Database
  • Source Journals of China Academic Journals (CD-ROM Version), China Journal Network
  • 2017-2019 China Outstanding Academic Journals with International Influence (Natural Science and Engineering Technology)
  • Source Journal of Top Academic Papers (F5000) Program of China's Excellent Science and Technology Journals
  • Source Journal of China Engineering Technology Electronic Information Network and Electronic Technology Literature Database
  • Source Journal of British Science Digest (INSPEC)
  • Japan Science and Technology Agency (JST) Source Journal
  • Russian Journal of Abstracts (AJ, VINITI) Source Journals
  • Full-text Journal of EBSCO, USA
  • Cambridge Scientific Abstracts (Natural Sciences) (CSA(NS)) core journals
  • Poland Copernicus Index (IC)
  • Ulrichsweb (USA)