Solving the TSP by the AALHNN algorithm

DOI10.3934/MBE.2022158MaRDI QIDQ2130400zbMATH OpenOpenAlexFDO

Authors Yun Hu, Qianqian Duan

Publication date 25 April 2022

Published in Mathematical Biosciences and Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/mbe.2022158

zbMATH Keywords

TSPaugmented LagrangianHNNLagrange neural network algorithmNesterov acceleration technique

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Recommendations

• scientific article; zbMATH DE number 1110519
• scientific article; zbMATH DE number 2219509
• Novel method to solve TSP by continuous Hopfield neural network
• Publication:4893554
• An efficient multivalued Hopfield network for the traveling salesman problem

Cites work

• scientific article; zbMATH DE number 3148887 (Why is no real title available?)
• A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem
• A logarithmic descent direction algorithm for the quadratic knapsack problem
• A new mechanical approach to handle generalized Hopfield neural networks
• A review of Hopfield neural networks for solving mathematical programming problems
• Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
• Lagrange programming neural networks
• Neurons with graded response have collective computational properties like those of two-state neurons
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• Solving the production transportation problem via a deterministic annealing neural network method
• ``Neural computation of decisions in optimization problems

Cited in

(4)

• Solving the traveling salesman problem using a recurrent neural network
• A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem
• Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem
• Novel method to solve TSP by continuous Hopfield neural network

This page was built for publication: Solving the TSP by the AALHNN algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2130400)