生产工序约束下物流资源多矛盾目标优化调度

Multi-contradictory-objective optimization scheduling of logistics resources under production process constraints

  • 摘要: 在车间生产工序约束下,为了实现物流资源的多矛盾目标优化调度,提出了密度自适应MOEA/D算法的调度方法。对智能车间中生产工序约束下的物流调度问题进行了分析,并建立了最小化完工时间、物流车数量和惩罚成本等多矛盾目标的优化调度模型。以MOEA/D算法为基础,设计了随邻域中染色体密度自适应变化的惩罚因子,调节了染色体多样性和算法收敛性,有效提高了算法的解集质量。将密度自适应MOEA/D算法应用于物流资源调度中并进行实验验证,结果表明:与MOEA/D算法、改进NSGA-II算法相比,密度自适应MOEA/D算法的解集质量更高、分布多样性更好。以3台物流车为例,密度自适应MOEA/D调度方案的完工时间最短,为749 min。实验结果证明了文章方法在物流资源多矛盾目标优化调度中的优越性。

     

    Abstract: In order to achieve multi-contradiction-objective optimization scheduling of logistics resources under the constraints of production processes, a density adaptive MOEA/D algorithm scheduling method was proposed. An analysis was conducted on the logistics scheduling problem under production process constraints in an intelligent workshop, and an optimization scheduling model was established with multiple conflicting objectives such as minimizing completion time, the number of logistics vehicles, and penalty costs. Based on the MOEA/D algorithm, a penalty factor that adapts to changes in chromosome density in the neighborhood was designed to regulate chromosome diversity and algorithm convergence, effectively improving the quality of the algorithm’s solution set. The density adaptive MOEA/D algorithm was applied to logistics resource scheduling and experimentally validated. The results showed that compared with the MOEA/D algorithm and the improved NSGA-II algorithm, the density adaptive MOEA/D algorithm has higher quality of solution set and better distribution diversity. Taking 3 logistics vehicles as an example, the density adaptive MOEA/D scheduling scheme has the shortest completion time of 749 min. The experimental results demonstrate the superiority of the method proposed in this paper in optimizing and scheduling logistics resources with multi-contradiction-objective.

     

/

返回文章
返回