Highly Influential

@article{Rashid2017AGL, title={A Greedy-Genetic Local-Search Heuristic for the Traveling Salesman Problem}, author={Mohammad Harun Rashid and Miguel A. Mosteiro}, journal={2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC)}, year={2017}, pages={868-872} }

- Published 2017 in 2017 IEEE International Symposium on Parallel and…
DOI:10.1109/ISPA/IUCC.2017.00132

The Travelling Salesman Problem (TSP) is one of the typical combinatorial optimization problems that is easy to describe but hard to solve. In this work, we present a novel solution that integrates a genetic algorithm, local-search heuristics, and a greedy algorithm. For the genetic algorithm we keep the evolutionary technique to generate children from… CONTINUE READING

### Presentations referencing similar topics