Fixed Task Scheduling of Industrial Robot using Genetic Algorithm Based Travelling Salesman Problem

The task scheduling of any industrial robots is a prior requirement to effectively use the capability by obtaining shortest path with optimum completion time. In this article, we have presented Travelling Salesman Problem (TSP) with Genetic Algorithm (GA) search technique based task scheduling technique for obtaining optimum shortest path of the task.TSP finds an optimal solution to search for the shortest route by considering every location for completing the required tasks by setting up GA. This article embrace the adaption and implementation of the Genetic Algorithm search strategy for the task scheduling problem in the cooperative control of multiple resources for getting shortest path with minimize the completion time for two zone specific task allocation problem. It can be inferred from the simulation results that the Genetic Algorithm search technique can be considered as a viable solution for the task scheduling problem.