关键词: 汽车混装线, 虚拟重排序, 整数规划, 束搜索

Abstract: Aiming at the virtual resequencing problem frequently raised in automobile paint shops,a 0-1 integer programming model was developed with the objective to minimize the number of color changes in the sequence of car bodies in white.A directed acyclic graph was used to represent virtual resequencing process,which was then converted to a shortest path problem.A beam search algorithm was proposed for solving this problem.During search process,both a local and a global evaluation functions were applied in selecting promising nodes.Problem instances with different parameter combinations were used to test the performance of the proposed algorithm.Computational results showed that the algorithm could significantly reduce the number of color changes in the initial sequence.Furthermore,it could result in better solutions than a simple rule-based beam search algorithm in the literature.

Key words: automobile mixed-model assembly lines, virtual resequencing, integer programming, beam search