Rishita Kalyani

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
—This Paper will deal with a combination of Ant Colony and Genetic Programming Algorithm to optimize Travelling Salesmen problem (NP-Hard). However, the complexity of the algorithm requires considerable computational time and resources. Parallel implementation can reduce the computational time. In this paper, emphasis in the parallelizing section is given(More)
  • 1