Login / Signup

An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots.

Yoshiyuki KarunoHiroshi NagamochiAleksandar Shurbevski
Published in: J. Adv. Comput. Intell. Intell. Informatics (2011)
Keyphrases
  • routing problem
  • dynamic programming
  • worst case
  • computational complexity
  • np hard
  • search strategy
  • special case
  • particle swarm optimization
  • convergence rate
  • binary particle swarm optimization
  • route optimization