Please use this identifier to cite or link to this item:
|Title:||Bacterial foraging optimization algorithm in robotic cells with sequence-dependent setup times||Authors:||Majumder, Arindam
Suganthan, Ponnuthurai Nagaratnam
|Keywords:||Engineering::Electrical and electronic engineering||Issue Date:||2019||Source:||Majumder, A., Laha, D. & Suganthan, P. N. (2019). Bacterial foraging optimization algorithm in robotic cells with sequence-dependent setup times. Knowledge-Based Systems, 172, 104-122. https://dx.doi.org/10.1016/j.knosys.2019.02.016||Journal:||Knowledge-Based Systems||Abstract:||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.||URI:||https://hdl.handle.net/10356/152083||ISSN:||0950-7051||DOI:||10.1016/j.knosys.2019.02.016||Rights:||© 2019 Elsevier B.V. All rights reserved.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||EEE Journal Articles|
Updated on Nov 26, 2021
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.