A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem

Area of Science:

• Optimization Algorithms
• Computational Operations Research
• Combinatorial Optimization

Background:

• The Traveling Salesman Problem (TSP) is a classic NP-hard problem in combinatorial optimization.
• Existing algorithms for TSP approximation may face challenges in solution quality and efficiency.
• There is a continuous need for novel methods to address complex optimization problems like TSP.

Purpose of the Study:

• To propose a new approximation method for the Traveling Salesman Problem.
• To leverage Lagrange multipliers and Hopfield-type barrier functions for enhanced solution quality.
• To develop an efficient and effective algorithm for solving TSP instances.

Main Methods:

• A novel method combining Lagrange multipliers and a Hopfield-type barrier function is presented.
• The method generates solutions by finding minimum points of a barrier problem with decreasing barrier parameters.
• Feasible descent directions are utilized, ensuring automatic satisfaction of variable bounds, and Lagrange multipliers are updated iteratively.

Main Results:

• The proposed method converges to a stationary point of the barrier problem without specific objective function conditions.
• Theoretical and numerical results indicate superior effectiveness and efficiency compared to the SoftAssign algorithm.
• The algorithm demonstrates robust performance in approximating solutions for the Traveling Salesman Problem.

Conclusions:

• The Lagrange multiplier and Hopfield-type barrier function method offers a promising approach for TSP approximation.
• This method provides a more effective and efficient alternative to existing algorithms like SoftAssign.
• The study contributes a valuable new tool for tackling complex combinatorial optimization problems.