4.7 Article

Optimal scheduling for palletizing task using robotic arm and artificial bee colony algorithm

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.engappai.2022.104976

关键词

Scheduling problem; Robotic arm; Palletizing problem; Multi-objective optimization problem with constraints; Artificial Bee Colony algorithm; Reinforcement Learning

向作者/读者索取更多资源

This paper focuses on the palletizing problem using robotic arms, considering three production lines. By proposing four objective functions and applying the Artificial Bee Colony algorithm, the authors solve the constrained multi-objective optimization problem. Experimental results show that the proposed approach significantly improves the production rate and satisfies specific requirements.
Palletizing using robotic arms is a common aspect of industrial robotization. Due to its efficiency, the robotic arm is often able to handle more then one production line. In such a case, the proper decision of selecting an item from one of several production lines will affect the overall efficiency. In this paper, three production lines handled by a single robotic arm are considered. Cycle time and maximum allowable waiting time of each item is taken into account. The authors proposed four different objective functions related to possible requirements in a factory environment, which led to constrained multi-objective optimization problems. To solve such a problem, the Artificial Bee Colony algorithm supported by Deb's rules has been applied. The obtained results have been compared with three basic decision mechanisms, and also with the Reinforcement Learning approach. It was shown that the proposed approach significantly increases the production rate and satisfies the particular requirements, i.e., minimum energy per palletized item ratio, equality of containers' filling.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据