.png){kind=icon}
返回
Lagrangian object relaxation neural network for combinatorial optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2005.03.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a Lagrangian object relaxation technique that can obtain a more near-optimal solution for the traveling salesman problem (TSP). It consists of two stages. First, a feasible solution is calculated and second, a more near-optimal solution is calculated by a Hopfield neural network (HNN). The Lagrangian object relaxation technique can help the HNN escape from the local minimum by correcting Lagrangian multipliers. The Lagrangian object relaxation neural network is analyzed theoretically and evaluated experimentally through simulating the TSP. The simulation results based on some TSPLIB benchmark problems show that the proposed method can find 100% valid solutions which are near-optimal solutions. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
hopfield neural network
Lagrangian multiplier
local minimum
gradient ascent learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
暂无机构信息
引用论文
Effect of volume fiber and crack length on interlaminar fracture properties of glass fiber reinforced polyester composites (GF/PO composites).png)
Mechanics
OAAI
MechanicsIF0
OAAI分享收藏Injury-Dependent and Disability-Specific Lumbar Spinal Gene Regulation following Sciatic Nerve Injury in the Rat大鼠坐骨神经损伤后损伤依赖性和残疾特异性腰椎基因调控PLOS ONEOAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容