Ant Colony Optimization ( ACO ) and a Variation of Bee Colony Optimization ( BCO ) in Solving TSP Problem , a Comparative Study

@inproceedings{Jasser2014AntCO,
  title={Ant Colony Optimization ( ACO ) and a Variation of Bee Colony Optimization ( BCO ) in Solving TSP Problem , a Comparative Study},
  author={Muhammed Basheer Jasser and Mohamad Sarmini and Rauf Yaseen},
  year={2014}
}
Traveler sales man problem is known research problem which has a lot of industrial applications. A lot of algorithms has been proposed to solve TSP, some of Ant Colony Optimization (ACO) and Bee Colony Optimization (BCO) algorithms. BCO algorithm has variations and enhancements to improve the performance. In this paper, a experimental comparison study… CONTINUE READING