A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
Sign Up to like & getrecommendations! Published in 2019 at "OPSEARCH"
DOI: 10.1007/s12597-019-00396-x
Abstract: In this paper we present a simple heuristic algorithm to find high-quality, feasible solutions, for the traveling salesman problem (TSP). We hypothesize, that the quality of the initial solution provided by the proposed heuristic will… read more here.
Keywords: algorithm; quality feasible; matrix; high quality ... See more keywords