Discrete heat transfer search for solving travelling salesman problem

DOI10.3934/mfc.2018012zbMath1486.68181OpenAlexW2883675621WikidataQ129447738 ScholiaQ129447738MaRDI QIDQ2668543

Poonam Savsani, Mohamed A. Tawhid

Publication date: 7 March 2022

Published in: Mathematical Foundations of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/mfc.2018012

zbMATH Keywords

NP-hardnessmeta-heuristiccombinatorial optimization problemtravelling salesman problemsdiscrete heat transfer search algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Thermodynamics and heat transfer (80A99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Solving nonlinear systems and unconstrained optimization problems by hybridizing whale optimization algorithm and flower pollination algorithm, A New Hybrid Binary Algorithm of Bat Algorithm and Differential Evolution for Feature Selection and Classification

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A random-key genetic algorithm for the generalized traveling salesman problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• The effect of the asymmetry of road transportation networks on the traveling salesman problem
• A new hybrid heuristic approach for solving large traveling salesman problem
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems
• A study of complexity transitions on the asymmetric traveling salesman problem
• Vehicle Routing
• 8/7-approximation algorithm for (1,2)-TSP
• A Method for Solving Traveling-Salesman Problems
• Computer Solutions of the Traveling Salesman Problem
• Branch-and-Bound Methods: A Survey
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem