An Improved Variable Neighborhood Search for the Reconfigurable Assembly Line Reconfiguring Problem

Abstract

Throughout the past several decades, the manufacturing industry has been confronted with rapidly evolving market demands. The Reconfigurable Assembly Line (RAL) changes the quantity and variety of products produced through reconfiguration at different stages. The reconfiguration stages of RAL include the reallocation of operations and resources. However, existing research has neglected the resources. In the paper, a mixed integer linear program for the Reconfigurable Assembly Line Reconfiguring Problem is first formulated. Subsequently, an efficient data structure is developed to model the process precedence constraint and alternative resources. And an improved Variable Neighborhood Search which includes new problem-specific neighborhood structures and local search for resource selection is proposed to solve the problem. Computational results demonstrate the contribution of the proposed data structure and the improved procedure. Furthermore, the experiments verify the superiority and stability of the proposed method compared with other heuristic algorithms.

Keywords

• reconfigurable assembly line
• reconfiguration
• mixed integer linear program
• data structure
• variable neighborhood search