Optimal-Cycle Search Task

An Optimal-Cycle Search Task is a cycle search task that is a optimal-path search task (that requires a optimal cycle in a graph).

• Context:
  • It can range from being a Shortest Cycle Search to being a Longest Cycle Search.
  • It can range from being a Single-Agent Optimal-Cycle Search to being a Multi-Agent Optimal-Cycle Search.
• Example(s):
  • a Traveling Salesperson Problem (that actually involves salesperson).
  • It can (typicall) be an NP-Hard Task.
  • …
• Counter-Example(s):
  • a Shortest Path Finding Task.
• See: Combinatorial Optimization Task, Graph Cycle.

---

---

References

2013

• http://en.wikipedia.org/wiki/Travelling_salesman_problem
  • The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. ...

---