This paper introduces a new algorithm for the TSP and the class of n-p complete combinatory problems, which was first found empirically, with the help of APL - used as a “tool of thought”. Then, a demonstration was worked out, which shows that simplicity - as well as vector programming - might lead to significant progresses in some fields of optimization. Programs are short and efficient. Reprogramming in Pascal or Fortran leads to a code that proved to run indeed faster than the interpreted APL models.… but only to a certain extent. The use of parallel processors would still greatly improve the solution of the TSP. APL should also play a role in this new tendency of computer science.
/lp/association-for-computing-machinery/the-travelling-salesman-problem-revisited-with-apl-an7KJjOj02