상세정보
학술대회
Design Considerations for Automated Crane Assignment
- 발행일
- 201807
- 출처
- International Conference on Mechanics and Mechatronics Research (ICMMR) 2018, pp.1-5
- 협약과제
- 17PH3400, 제조 및 물류처리 최적화를 위한 IIoT 및 분산제어 플랫폼 기술 개발, 윤대섭
- 초록
- This paper describes a method of multiple cranes assignment to operators who call cranes in a factory. Due to a crane moving on a rail, there is a restriction on the movement. Therefore, the crane cannot be delivered without proper assignment. To solve the cranes assignment problem, we propose two methods. The first is the optimal solution search method which finds the minimum travel distance combination from the number of cases that are derived by calculating the distance between all the cranes and all the operators. The second is the dynamic mapping method which finds the number of operators between each crane. Simulation results show that the dynamic mapping method sometimes performs the same assignment results as the optimal solution search method, but on average, the result of dynamic mapping method is farther than the optimal solution as the number of cranes increases. When partial regions are created by using the dynamic mapping method and an optimal solution search method is applied to each region, optimal solutions can be acquired while reducing the number of calculations.
- KSP 제안 키워드
- Assignment problem, Crane assignment, Design considerations, Mapping method, Optimal Solution, dynamic mapping, each region, search method, simulation results, travel distance