There is a well known similar type of problem called the Travelling salesman problem.
Artificial intelligence researcher Marco Dorigo described in 1997 a method of heuristically generating "good solutions" to the TSP using a simulation of an ant colony called ACS (Ant Colony System).
Death of a Salesman | Year 2000 problem | Waring's problem | The Final Problem | The Problem with Popplers | Hume and the Problem of Causation | Dirichlet problem | Boolean satisfiability problem | The Dog Problem | Tammes problem | Species problem | problem solving | Problem gambling | Packing problem | packing problem | Death of a Salesman (2000 film) | chess problem | Znám's problem | Year 10,000 problem | Yamabe problem | Weber problem | Undecidable problem | Travelling Without Moving | Travelling without Moving | Travelling the EU | Travelling salesman problem | travelling salesman problem | Travelling Riverside Blues | Travelling in Greece'' (''Menoume Ellada'') | The Problem of Thor Bridge |
In the Macintosh computer game Crystal Quest the objective is to collect crystals, in a fashion similar to the travelling salesman problem.