Leung Pun Wong

  • Citations Per Year
Learn More
The Traveling Salesman Problem (TSP) is an NP-hard problem that has been used as a significant testing ground for many algorithms. It is also a problem that appears in many real industrial problems. This paper describes a Bee Colony Optimization (BCO) algorithm with a fragmentation state transition rule (FSTR) for TSP. The FSTR in the BCO algorithm helps(More)
  • 1