1. Asani EO, Okeyinka AE, Adebiyi AA (2020) A construction tour technique for solving the travelling salesman problem based on convex hull and nearest neighbour heuristics. Proceeding of IEEE international conference in mathematics, computer engineering and computer science (ICMCECS), (2020), pp 1–4. https://doi.org/10.1109/ICMCECS47690.2020.240847.
2. Deudon M, Cournut P, Lacoste A, Adulyasak Y, Rousseau LM (2018) Learning heuristics for the TSP by policy gradient. In: van Hoeve WJ (eds) Integration of constraint programming, artificial intelligence, and operations research. CPAIOR (2018), Lecture Notes in Computer Science, vol 10848. Springer, Cham
3. Oliveira JF, Carravilla MA (2009) Heuristics and local search, Available online: https://paginas.fe.up.pt/~mac/ensino/docs/OR/CombinatorialOptimizationHeuristicsLocalSearch.pdf. Accessed 13 Feb 2019
4. Marti R, Reinelt G (2011) Heuristic Methods. The linear ordering problem exact and heuristic methods in combinatorial optimisation, Springer, Berlin, Heidelberg. ISBN: 978–3–64–16728–7, pp 17–40. https://doi.org/10.1007/978-3-642-16729-42
5. Kyritsis M, Gulliver SR, Feredoes E, Ud Din S (2018) Human behaviour in the Euclidean travelling salesperson problem: computational modelling of heuristics and figural effects. Cognitive Syst Res 52:387–399