A novel optimized cyclic part feeding system with line-integrated supermarkets

Abstract

To unify the merits of traditional in-plant parts logistics alternatives such as line stocking and kitting, the concept of line-integrated supermarkets is introduced to improve the part feeding in mixed-model assembly lines. First, the highly interdependent optimization problems of assigning stations and scheduling logistics operators are described, and mathematical models are established with the aim to minimize the fleet size of logistics operators and unit part delivery time as well. Together with particular theorems and lemmas, a nested dynamic programming is presented to obtain global optimum for small-sized instances while a modified harmony search algorithm is constructed for medium- or large-sized instances. Benefit from repeatedly dividing and reconstructing the harmony memory, the computation speed is significantly enhanced. Meanwhile, crossover and mutation operations effectively improve the diversity of solutions to overcome deficiencies such as limited search depth and tendencies to trapping into local optimum. Finally, experimental results validate that the proposed algorithm is of competitive performance in effectiveness and efficiency compared to some other basic or modified meta-heuristics.