混流装配生产线准时化物料补给调度方法
发布时间：2019-02-18 14:29
【摘要】：针对准时化顺序供应的混流装配生产线物料补给问题进行数学规划建模,通过决策各次物料补给作业的发车时间和料箱标号使线边物料的库存成本最小.为了解决这一复杂的混合优化问题,给出了问题的性质分析,并将该问题转化为求解最优料箱配送序列的组合优化问题.在此基础上,构建反向动态规划求解算法以获得该问题的最优解,并证明该算法具有指数级别的时间复杂度.为了求解中大规模调度问题,构建了改进蜂群算法,通过在邻域搜索部分融合基于分布估计算法的个体更新机制来强化基本蜂群算法的收敛性能.最后通过仿真实验验证了所提出算法的可行性和有效性.
[Abstract]:The material supply problem of the mixed-flow assembly line supplied in the on-time order is modeled by the mathematical programming, and the inventory cost of the line-edge material is minimized by making the departure time and the material box label of each sub-material supply operation. In order to solve this complex hybrid optimization problem, the property analysis of the problem is given, and the problem is transformed into a combinatorial optimization problem for solving the optimal material box distribution sequence. On this basis, a reverse dynamic programming algorithm is constructed to obtain the optimal solution of the problem, and it is proved that the algorithm has the time complexity of the exponential level. In order to solve the problem of large-scale scheduling, an improved colony algorithm is built, and the convergence performance of the basic bee colony algorithm is enhanced by combining the individual updating mechanism based on the distribution estimation algorithm in the neighborhood search part. Finally, the feasibility and effectiveness of the proposed algorithm are verified by the simulation experiment.
【作者单位】： 同济大学机械与能源工程学院;
【基金】：国家自然科学基金项目(71471135,61273035)
【分类号】：TB497;TP18
，
本文编号：2425931
[Abstract]:The material supply problem of the mixed-flow assembly line supplied in the on-time order is modeled by the mathematical programming, and the inventory cost of the line-edge material is minimized by making the departure time and the material box label of each sub-material supply operation. In order to solve this complex hybrid optimization problem, the property analysis of the problem is given, and the problem is transformed into a combinatorial optimization problem for solving the optimal material box distribution sequence. On this basis, a reverse dynamic programming algorithm is constructed to obtain the optimal solution of the problem, and it is proved that the algorithm has the time complexity of the exponential level. In order to solve the problem of large-scale scheduling, an improved colony algorithm is built, and the convergence performance of the basic bee colony algorithm is enhanced by combining the individual updating mechanism based on the distribution estimation algorithm in the neighborhood search part. Finally, the feasibility and effectiveness of the proposed algorithm are verified by the simulation experiment.
【作者单位】： 同济大学机械与能源工程学院;
【基金】：国家自然科学基金项目(71471135,61273035)
【分类号】：TB497;TP18
，
本文编号：2425931
本文链接：https://www.wllwen.com/kejilunwen/zidonghuakongzhilunwen/2425931.html
