스케줄링 문제를 위한 멀티로봇 위치 기반 다목적 유전 알고리즘Multi-Objective Genetic Algorithm based on Multi-Robot Positions for Scheduling Problems
- Other Titles
- Multi-Objective Genetic Algorithm based on Multi-Robot Positions for Scheduling Problems
- Authors
- 최종훈; 박장현; 김제석; 정진한; 김정민
- Issue Date
- 2014
- Publisher
- 한국정밀공학회
- Keywords
- Scheduling Problem (스케줄링 문제); High-Density Robot (고밀도 로봇); Multi-Objective Genetic Algorithm (다목적 유전 알고리즘); Multi-Robot Position (멀티로봇 위치)
- Citation
- 한국정밀공학회지, v.31, no.8, pp.689 - 696
- Indexed
- KCI
- Journal Title
- 한국정밀공학회지
- Volume
- 31
- Number
- 8
- Start Page
- 689
- End Page
- 696
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/161015
- DOI
- 10.7736/KSPE.2014.31.8.689
- ISSN
- 1225-9071
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 미래자동차공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/161015)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.