论文部分内容阅读
针对准时化顺序供应的混流装配生产线物料补给问题进行数学规划建模,通过决策各次物料补给作业的发车时间和料箱标号使线边物料的库存成本最小.为了解决这一复杂的混合优化问题,给出了问题的性质分析,并将该问题转化为求解最优料箱配送序列的组合优化问题.在此基础上,构建反向动态规划求解算法以获得该问题的最优解,并证明该算法具有指数级别的时间复杂度.为了求解中大规模调度问题,构建了改进蜂群算法,通过在邻域搜索部分融合基于分布估计算法的个体更新机制来强化基本蜂群算法的收敛性能.最后通过仿真实验验证了所提出算法的可行性和有效性.
In order to solve the complicated hybrid optimization problem, the math planning and modeling are carried out for the material supply problem of the mixed assembly line which is supplied on time and order, and the inventory cost of the line edge material is minimized by determining the departure time and the material box number of each material supply operation. , This paper gives a qualitative analysis of the problem and transforms it into a combinatorial optimization problem for solving the optimal distribution sequence of the bins.On the basis of this, we construct an inverse dynamic programming solution algorithm to obtain the optimal solution of the problem and prove The algorithm has exponential time complexity.In order to solve the large-scale medium-scale scheduling problem, this paper proposes an improved bee colony algorithm, which enhances the convergence performance of the basic bee colony algorithm by combining the individual update mechanism based on the distribution estimation algorithm in the neighborhood search. Finally, the feasibility and validity of the proposed algorithm are verified by simulation experiments.