Bacterial foraging optimization algorithm in robotic cells with sequence-dependent setup times

doi:10.1016/j.knosys.2019.02.016

Return

Bacterial foraging optimization algorithm in robotic cells with sequence-dependent setup times

2019-05-01

PRE

Arindam Majumder

Dipak Laha

Ponnuthurai Nagaratnam Suganthan *

DOI：10.1016/j.knosys.2019.02.016

Original

Original request for help

Save

Abstract

En 中文

In this paper, we propose an improved discrete bacterial foraging algorithm to determine the optimal sequence of parts and robot moves in order to minimize the cycle time for the 2-machine robotic cell scheduling problem with sequence-dependent setup times. We present a method to convert the solutions from continuous to discrete form. In addition, two neighborhood search techniques are employed to updating the positions of each bacterium during chemotaxis and elimination-dispersal operations in order to accelerate the search procedure and to improve the solution. Moreover, a multi-objective optimization algorithm based on NSGA-II combined with the response surface methodology and the desirability technique is applied to tune the parameters as well as to enhance the convergence speed of the proposed algorithm. Finally, a design of experiment based on central composite design is used to determine the optimal settings of the operating parameters of the proposed algorithm. The results of the computational experimentation with a large number of randomly generated test problems demonstrate that the proposed method is relatively more effective and efficient than the state-of-the-art algorithms in minimizing the cycle time in the robotic cell scheduling. (C) 2019 Elsevier B.V. All rights reserved.

Keywords:

2-machine robotic cell

Sequencing of parts

Sequencing of robot moves

Cycle time

Minimal part set sequence

Bacterial foraging algorithm

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.