Computationally hard problems, like the Traveling Salesperson Problem, can be solved remarkably well by humans. Results obtained by computers are usually closer to the optimum, but require high computational effort and often differ from the human solutions. This paper introduces Greedy Expert Search (GES) that strives to show the same flexibility and efficiency of human solutions, while producing results of similarly high quality. The Traveling Salesperson Problem serves as an example problem to illustrate and evaluate the approach.
['Alexandra Kirsch']
Humanlike Problem Solving in the Context of the Traveling Salesperson Problem