汽车涂装中虚拟重排序问题建模与求解

Modeling and solving of virtual re-sequencing problem in car painting

针对汽车涂装中的虚拟重排序问题,建立了关于颜色转换次数最少的0-1二次整数规划模型.根据0-1变量的特点,把该0-1二次整数规划转化为以相邻颜色个数最大为目标的0-1线性整数规划,从而使得所建立的虚拟重排序模型可直接用现有优化软件求解,无须设计专门解法.所建模型在任何虚拟重排序场合均可采用或借鉴.

Aiming at the virtual re-sequencing problem in car painting,a model of 0-1 quadratic integer programming with the goal of the least number of color transformation is formulated.Based on the characteristic of 0-1 variable,the 0-1 quadratic integer programming is transformed into a 0-1 linear integer programming,with the largest number of adjacent colors as the goal.Thus,the established virtual re-sequencing model can be solved by the existing solvers,with no need to design algorithms.The model built can be adopted or referenced by any virtual re-sequencing problem.