Scholarlink

<p>Zeroing neural networks (ZNNs), a specialized class of recurrent neural networks, have demonstrated remarkable effectiveness in matrix computation and dynamic optimization problems due to their inherent parallel computing capabilities. In this paper, a predefined-time and noise reduction ZNN (PTNRZNN) model is proposed for solving convex quadratic programming problems with equality and inequality constraints. Additionally, a new activation function is proposed, demonstrating enhanced accelerated convergence and noise reduction performance compared to previous models. The convergence and robustness of the PTNRZNN model are effectively proven through theoretical assessment. Furthermore, the performance of the PTNRZNN model is further validated through simulation experiments. Finally, the PTNRZNN model is applied to the binary assignment problem in logistics (BAPL), yielding optimized results with an error margin as low as <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11227_2025_7694_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="33" /> </InlineMediaObject> <EquationSource Format="TEX">\(10^{-2}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mn>10</mn> <mrow> <mo>-</mo> <mn>2</mn> </mrow> </msup> </math></EquationSource> </InlineEquation> compared to theoretical values. The strong robustness of the method makes it an excellent performer in solving BAPL under noise interference.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Predefined-time ZNN model with noise reduction for solving quadratic programming and its application to binary assignment problem in logistics

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年8月11日

查看全文
  • Bolin Liao,
  • Jinsha Xu,
  • Cheng Hua,
  • Tinglei Wang,
  • Shuai Li

摘要

Zeroing neural networks (ZNNs), a specialized class of recurrent neural networks, have demonstrated remarkable effectiveness in matrix computation and dynamic optimization problems due to their inherent parallel computing capabilities. In this paper, a predefined-time and noise reduction ZNN (PTNRZNN) model is proposed for solving convex quadratic programming problems with equality and inequality constraints. Additionally, a new activation function is proposed, demonstrating enhanced accelerated convergence and noise reduction performance compared to previous models. The convergence and robustness of the PTNRZNN model are effectively proven through theoretical assessment. Furthermore, the performance of the PTNRZNN model is further validated through simulation experiments. Finally, the PTNRZNN model is applied to the binary assignment problem in logistics (BAPL), yielding optimized results with an error margin as low as \(10^{-2}\) 10 - 2 compared to theoretical values. The strong robustness of the method makes it an excellent performer in solving BAPL under noise interference.