analysis; complementary non-deterministic polynomial; exponential; exponential-time; exponential-time algorithm; metaheuristic; non-deterministic polynomial time; non-deterministic Turing Machine; non-polynomial; NP; NP-complete; NP-hard; polynomial; polynomial-time; polynomial-time algorithm; space complexity; time complexity; travelling salesman problem;