Bi‐objective minimization of energy consumption and cycle time for the robotic assembly line balancing problem: pseudo‐polynomial case and reduced search space metaheuristic

Abstract

Listen

Translate article

AbstractEnergy consumption and cycle time are two contradictory optimization objectives for the robotic assembly line balancing problem (RALBP). Indeed, minimizing the cycle time leads to choosing the fastest robots, while minimizing the energy consumption leads to choosing the robots with the smallest powers. In the context of RALBP, cycle time minimization has been extensively studied while energy minimization has been much less considered. Studies dealing with simultaneous minimization of the two later are even scarcer. A bi‐objective RALBP considering simultaneous minimization of cycle time and energy consumption is studied in this paper. The energy consumption is calculated based on recent papers from the literature. It includes energy consumed during both operation time and idle time. In this paper, a pseudo‐polynomial case is solved thanks to an exact algorithm called split. This latter enumerates all Pareto‐optimal solutions corresponding to a given giant sequence of operations. Split is then used as a decoder in a metaheuristic operating in a reduced search space where giant sequences encode solutions. An experimental study is performed on instances taken from the literature to test the suggested encoding–decoding scheme. It shows that the suggested approach yields competitive results compared to the literature.