Algorithm Research & Explore
|
1998-2002,2024

Belief propagation algorithm for solving minimum cost maximum flow problem

Zuo Fengyuana
Wang Xiaofenga,b
Niu Jina
Liang Chena
a. College of Computer Science & Engineering, b. The Key Laboratory of Intelligent Information & Big Data Processing of Ningxia Province, North Minzu University, Yinchuan 750021, China

Abstract

The minimum cost and large flow problem is a combinatorial optimization problem, which has important research significance and application value in the fields of economy and industry. In view of the low efficiency of the algorithm for solving part of the minimum cost and maximum flow problem, according to the linear programming equation of the minimum cost and maximum flow problem, this paper mapped the problem model to the corresponding factor graph model, improved the description function, gave the iteration equation, and designed the minimum cost belief propagation algorithm for maximum flow problem. It used the iterative equation to perform convergence calculation on the maximum feasible flow eigenvalue firstly, and obtained the maximum flow, and set the maximum flow threshold. On this basis, the minimum cost calculation was performed to obtain the optimal solution of the problem. Finally, this paper selected a number of weighted directed graph models for numerical experiments to verify the feasibility and effectiveness of the algorithm. The results show that the algorithm is superior to some algorithms in terms of solving efficiency.

Foundation Support

国家自然科学基金资助项目(62062001,61762019,61862051,61962002)
北方民族大学重大专项资助项目(ZDZX201901)
宁夏自然科学基金资助项目(2020AAC03214,2020AAC03219,2019AAC03120,2019AAC03119)
北方民族大学校级科研一般项目(2019XYZJK05)

Publish Information

DOI: 10.19734/j.issn.1001-3695.2020.10.0357
Publish at: Application Research of Computers Printed Article, Vol. 38, 2021 No. 7
Section: Algorithm Research & Explore
Pages: 1998-2002,2024
Serial Number: 1001-3695(2021)07-015-1998-05

Publish History

[2021-07-05] Printed Article

Cite This Article

左逢源, 王晓峰, 牛进, 等. 求解最小费用最大流问题的信念传播算法 [J]. 计算机应用研究, 2021, 38 (7): 1998-2002,2024. (Zuo Fengyuan, Wang Xiaofeng, Niu Jin, et al. Belief propagation algorithm for solving minimum cost maximum flow problem [J]. Application Research of Computers, 2021, 38 (7): 1998-2002,2024. )

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)