DOI QR코드

DOI QR Code

Multi-Objective Genetic Algorithm based on Multi-Robot Positions for Scheduling Problems

스케줄링 문제를 위한 멀티로봇 위치 기반 다목적 유전 알고리즘

  • 최종훈 (한양대학교 자동차공학과) ;
  • 김제석 (한양대학교 자동차공학과) ;
  • 정진한 (한양대학교 자동차공학과) ;
  • 김정민 (아주대학교 기계공학과) ;
  • 박장현 (한양대학교 미래자동차공학과)
  • Received : 2014.05.02
  • Accepted : 2014.06.16
  • Published : 2014.08.01

Abstract

This paper presents a scheduling problem for a high-density robotic workcell using multi-objective genetic algorithm. We propose a new algorithm based on NSGA-II(Non-dominated Sorting Algorithm-II) which is the most popular algorithm to solve multi-objective optimization problems. To solve the problem efficiently, the proposed algorithm divides the problem into two processes: clustering and scheduling. In clustering process, we focus on multi-robot positions because they are fixed in manufacturing system and have a great effect on task distribution. We test the algorithm by changing multi-robot positions and compare it to previous work. Test results shows that the proposed algorithm is effective under various conditions.

Keywords

References

  1. Hara, S. and Azuma, K., "Cell Production System for Assembly," Robotics and Computer-Integrated Manufacturing, Vol. 4, No. 3, pp. 379-385, 1988. https://doi.org/10.1016/0736-5845(88)90008-7
  2. Deb, K., "Multi-Objective Optimization using Evolutionary Algorithms," John Wiley & Sons, 2001.
  3. Bektas, T., "The Multiple Traveling Salesman Problem: An Overview of Formulations and Solution Procedures," Omega, Vol. 34, No. 3, pp. 209-219, 2006. https://doi.org/10.1016/j.omega.2004.10.004
  4. Carter, A. E. and Ragsdale, C. T., "A New Approach to Solving the Multiple Traveling Salesperson Problem using Genetic Algorithms," European Journal of Operational Research, Vol. 175, No. 1, pp. 246-257, 2006. https://doi.org/10.1016/j.ejor.2005.04.027
  5. Konak, A., Coit, D. W., and Smith, A. E., "Multi- Objective Optimization using Genetic Algorithms: A Tutorial," Reliability Engineering & System Safety, Vol. 91, No. 9, pp. 992-1007, 2006. https://doi.org/10.1016/j.ress.2005.11.018
  6. Krishna, K. and Murty, M. N., "Genetic K-Means Algorithm," Proc. of the IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, Vol. 29, No. 3, pp. 433-439, 1999. https://doi.org/10.1109/3477.764879
  7. Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T., "A Fast and Elitist Multiobjective Genetic Algorithm: Nsga-II," Proc. of the IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2, pp. 182-197, 2002.
  8. Kim, K. H., Ku, T. W., and Baek, J. M., "Reliability Allocation Optimization for Software Modules using Multi-Objective Genetic Algorithm," Journal of Korea Information Science Society: Software and Applications, Vol. 39, No. 3, pp. 205-214, 2012.
  9. Seshadri, A., "A Fast Elitist Multiobjective Genetic Algorithm: NSGA-II," MATLAB Central, pp. 1-4, 2006.
  10. Yuan, S., Skinner, B., Huang, S., and Liu, D., "A New Crossover Approach for Solving the Multiple Travelling Salesmen Problem using Genetic Algorithms," European Journal of Operational Research, Vol. 228, No. 1, pp. 72-82, 2013. https://doi.org/10.1016/j.ejor.2013.01.043
  11. Walshaw, C., "A Multilevel Lin-Kernighan-Helsgaun Algorithm for the Travelling Salesman Problem," Citeseer, pp. 1-9, 2001.
  12. Helsgaun, K., "General k-Opt Submoves for the Lin- Kernighan TSP Heuristic," Mathematical Programming Computation, Vol. 1, No. 2-3, pp. 119-163, 2009. https://doi.org/10.1007/s12532-009-0004-6
  13. Nallusamy, R., Duraiswamy, K., Dhanalaksmi, R., and Parthiban, P., "Optimization of Non-Linear Multiple Traveling Salesman Problem using K-Means Clustering, Shrink Wrap Algorithm and Meta- Heuristics," International Journal of Nonlinear Science, Vol. 9, No. 2, pp. 171-177, 2010.
  14. Lim, S. S., Kim, J. S., and Park, J. H., "Multi- Objective Genetic Algorithm for High-Density Robotic Workcell," Proc. of the IEEE International Symposium on Robotics (ISR), pp. 1-3, 2013.