求解U型装配线平衡的改进启发式算法

Improved heuristic algorithm for U-shaped assembly line balancing

在假设条件下建立单U型装配线第一类平衡规划模型,根据表达产品作业优先关系的邻接矩阵特征,确定入口和出口候选作业集合,依据综合阶位值大小依次选择分配作业,求解单U型装配线平衡问题。结合小算例,详细说明了改进启发式算法的求解过程并编程计算,运用改进启发式算法程序计算了32个经典算例,将计算结果和评价指标分别与启发式算法和遗传算法进行对比,验证了该改进启发式算法有效,且计算速度快、计算结果稳定。

The type-1 balance model for the single U-shaped assembly line under the assumptions is established.First,according to the characteristics of the adjacency matrix that expresses the priority relationship of the operations,the set of candidate tasks for the entry and exit are determined.Then the assignment tasks are selected in turn according to the comprehensive rank value.Finally,the single U-shaped assembly line balancing problem is solved.Combined with one example,the solution process of the improved heuristic algorithm is explained and programmed.32 classic examples are calculated using the improved heuristic algorithm program.The calculation results and evaluation indicators are compared with the heuristic algorithm and genetic algorithm respectively.It is verifiedthat the improved heuristic algorithm is effective,fastandstable.