Weighted amplifiers and inapproximability results for Travelling Salesman problem
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-020-00659-0
Abstract: The expander graph constructions and their variants are the main tool used in gap preserving reductions to prove approximation lower bounds of combinatorial optimisation problems. In this paper we introduce the weighted amplifiers and weighted… read more here.
Keywords: amplifiers inapproximability; results travelling; salesman problem; weighted amplifiers ... See more keywords
Hybrid optimizer for the travelling salesman problem
Sign Up to like & getrecommendations! Published in 2019 at "Evolutionary Intelligence"
DOI: 10.1007/s12065-019-00208-7
Abstract: In this paper, a hybrid model which combines genetic algorithm and heuristics like remove-sharp and local-opt with ant colony system (ACS) has been implemented to speed-up convergence as well as positive feedback and optimizes the… read more here.
Keywords: salesman problem; optimizer travelling; hybrid optimizer; travelling salesman ... See more keywords
A pre-processing reduction method for the generalized travelling salesman problem
Sign Up to like & getrecommendations! Published in 2019 at "Operational Research"
DOI: 10.1007/s12351-019-00533-w
Abstract: The generalized travelling salesman problem (GTSP) is a variant of the well-known travelling salesman problem. The cities are in this case spread into clusters and only one city from each one must be visited to… read more here.
Keywords: reduction; generalized travelling; salesman problem; travelling salesman ... See more keywords
Amoeba-inspired analog electronic computing system integrating resistance crossbar for solving the travelling salesman problem
Sign Up to like & getrecommendations! Published in 2020 at "Scientific Reports"
DOI: 10.1038/s41598-020-77617-7
Abstract: Combinatorial optimization to search for the best solution across a vast number of legal candidates requires the development of a domain-specific computing architecture that can exploit the computational power of physical processes, as conventional general-purpose… read more here.
Keywords: system; electronic computing; solving travelling; problem ... See more keywords
An effective hybrid harmony search for the asymmetric travelling salesman problem
Sign Up to like & getrecommendations! Published in 2019 at "Engineering Optimization"
DOI: 10.1080/0305215x.2019.1579804
Abstract: ABSTRACT This article is part of a study aiming to adapt the Harmony Search (HS) algorithm to the asymmetric travelling salesman problem. The population-based approach of the HS algorithm and its weak exploitation mechanism constituted… read more here.
Keywords: salesman problem; harmony search; asymmetric travelling; travelling salesman ... See more keywords
Scalable In-Memory Clustered Annealer With Temporal Noise of Charge Trap Transistor for Large Scale Travelling Salesman Problems
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Journal on Emerging and Selected Topics in Circuits and Systems"
DOI: 10.1109/jetcas.2023.3244485
Abstract: Combinatorial optimization problems (COP) are ubiquitous and practical in our daily life, but many of them are NP-hard and intractable to solve using conventional computing. Ising model-based annealer has gained increasing attention due to its… read more here.
Keywords: scalable memory; scale; large scale; travelling salesman ... See more keywords
A Labelling Method for the Travelling Salesman Problem
Sign Up to like & getrecommendations! Published in 2023 at "Applied Sciences"
DOI: 10.3390/app13116417
Abstract: The travelling salesman problem (TSP) is a problem whereby a finite number of nodes are supposed to be visited exactly once, one after the other, in such a way that the total weight of connecting… read more here.
Keywords: problem; labelling method; salesman problem; travelling salesman ... See more keywords