1 publication

• Published Subscription 16 May 2019

  Resolving Travelling Salesman Problem Using Modified Clustering Technique

  By Hardik Dhingra, Gagan Deep Dhand, Rashmi Chawla, Shailender Gupta, Samarth Mittal

  Abstract: AbstractTravelling Salesman Problem (TSP) is a quotidian stumbling block in the field of Computer Science and operation research designed to seek out the shortest pathway amid the given targets viz. cities where each target is considered only once. Many solutions to this setback like Ant Colony Optimization. Brute-Force approach, Genetic Algorithm, Fruit Fly Optimization etc. are available in literature. The main objective of these solutions is to minimize the time …

  Published in Research & Reviews: Discrete Mathematical Structures · Vol. 6, Issue 1, 2019 · pp. 22–31 Read article →