Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme

DOI10.1007/S00500-016-2039-8MaRDI QIDQ1701902zbMATH OpenOpenAlexFDO

Authors Lucas García, Pedro M. Talaván, Javier Yáñez

Publication date 27 February 2018

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00500-016-2039-8

zbMATH Keywords

artificial neural networkstraveling salesman problemdivide-and-conquerHopfield network

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Novel method to solve TSP by continuous Hopfield neural network
• Publication:4893554
• On problem solving with Hopfield neural networks
• An efficient multivalued Hopfield network for the traveling salesman problem
• IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM

Cites work

• scientific article; zbMATH DE number 1953201 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A continuous Hopfield network equilibrium points algorithm
• A learning method in Hopfield neural network for combinatorial optimization problem
• A review of Hopfield neural networks for solving mathematical programming problems
• An efficient multivalued Hopfield network for the traveling salesman problem
• Necessary and sufficient condition for multistability of neural networks evolving on a closed hypercube
• Neural networks: computational models and applications.
• Neurons with graded response have collective computational properties like those of two-state neurons
• On parameter settings of Hopfield networks applied to traveling salesman problems
• On the performance of the LP-guided Hopfield network-genetic algorithm
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• Solving large scale combinatorial optimization problems based on a divide and conquer strategy
• TSPLIB—A Traveling Salesman Problem Library
• The Euclidean traveling salesman problem is NP-complete
• The generalized quadratic knapsack problem. A neuronal network approach
• The traveling salesman. Computational solutions for RSP applications
• ``Neural computation of decisions in optimization problems

Cited in

(5)

• A novel fractional-order memristive Hopfield neural network for traveling salesman problem and its FPGA implementation
• IMPROVED PROJECTION HOPFIELD NETWORK FOR THE QUADRATIC ASSIGNMENT PROBLEM
• scientific article; zbMATH DE number 1784865 (Why is no real title available?)
• Optimizing hyperparameters in Hopfield neural networks using evolutionary search
• Novel method to solve TSP by continuous Hopfield neural network

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme

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