混流装配线准时化物料配送调度优化

Optimal schedule of just-in-time part distribution for mixed-model assembly lines

针对混流装配线的准时化物料配送问题,综合考虑搬运设备的运载能力和装配线不允许缺货约束,构建了车辆装载与路径规划的联合优化模型。首先,进行了问题域的描述,并以最小化物料搬运期间所有工位中的最大加权库存水平为目标建立了数学规划模型。其次,结合该调度问题的两条基本性质,提出了回溯搜索算法以获得小规模问题的精确解。此外,为了有效地应对中大规模问题的爆炸搜索空间,构建了改进型离散人工蜂群算法。该算法通过在邻域变换中融入局部搜索和差分进化操作以提升其收敛性能。最后进行了仿真实验,结果验证了准时化配送模型及调度算法的可行性、有效性。

For Just-in-Time （JIT ） part distribution problem in Mixed-Model Assembly Lines （MMALs ） , an integrated vehicle filling and routing scheduling model is presented with consideration of loading capacities and no sock-outs constraints of assembly lines. First, a scheduling problem domain is described and then the mathematical programming model is developed with an objective to minimize the maximum weighted inventory level in all stations and production cycles. Second, the backtracking method is established to optimally solve small-scale instances based on two properties of the proposed scheduling model. Third, a Modified Discrete Artificial Bee Colony （MDABC ） algorithm is introduced to cope with the exploding search space of medium - and large-scale instances. Both local search and differential evolution operations are employed for neighbor search, which improves the convergence performance of the modified metaheuristic effectively. Finally, simulations are carried out and the experiment results verify the feasibility and effectiveness of the proposed JIT distribution model and methods.