7. Conclusion
Genetic algorithm, differential evolution, particle swarm optimization, artificial bee colony and charged system search algorithms are proposed to solve robot workcell layout problems. The performance of these five algorithms are evaluated using ten problems generated randomly. Three objective functions are considered in this paper, viz, Layout area, operation time and manipulability of robot. The implementation details of all the algorithms are presented. Two layout representation schemes, B*tree and sequence pair are evaluated and found that sequence pair representation scheme performs better. The parameters of the five nature inspired algorithms considered in this paper are fine-tuned to get better results. The assembly robot used to illustrate the problem is Mitsubishi RV-6SQ. Two objective case and three case of the problems are analysed separately and the results are presented. NSGA-II is used to handle multiple objectives and to optimize them simultaneously. It is found that PSO performs better over other algorithms. Bestlayouts for the two-objective three-objective cases are generated using PSO. The best layout design was found by optimizing three objectives simultaneously as there is trade-off among the objective functions. Future research work could expand the cell size with more number of machines and more number of robots. Another research direction could be to develop layout representation schemes, which are efficient and fast to generate layouts.