Discrete greedy flower pollination algorithm for spherical traveling salesman problem
Sign Up to like & getrecommendations! Published in 2017 at "Neural Computing and Applications"
DOI: 10.1007/s00521-017-3176-4
Abstract: This paper deals with the spherical traveling salesman problem. In this problem, all cities are located on the surface of a sphere and the cities must be visited exactly once in a tour. We propose… read more here.
Keywords: salesman problem; traveling salesman; flower pollination; spherical traveling ... See more keywords