高级检索

货物关联性和优先级约束下的多目标异构AGV调度问题研究

Research on Multi-objective Scheduling Problem of Heterogeneous AGVs with Cargo Correlation and Priority

  • 摘要: 针对复杂多目标异构自动引导车调度问题(MOSPHA-CP),综合考虑货物关联性与优先级,建立融合违约成本、客户信誉度、拣选时间要求、货物需求量及客户等级等优先级因素的多目标优化模型。为高效求解该问题,提出一种改进的混合变邻域搜索算法(hybrid variable neighborhood search,HVNS),其采用两阶段聚类与随机成本最优机制生成高质量的初始解,通过关联性破坏重组机制实现邻域扰动以避免早熟收敛,并结合多种邻域变换操作执行全局搜索以获得优质的可行解。采用IACO,GAVNS及改进的HVNS算法进行仿真实验,基于求解质量、收敛性、帕累托前沿等性能指标比较验证改进算法求解MOSPHA-CP的有效性。结果表明:改进HVNS在解质量上较对比算法提升30%~40%,且收敛性和帕累托前沿指标均表现出显著优势,验证了该算法求解MOSPHA-CP的有效性。

     

    Abstract: For the complex multi-objective scheduling problem of heterogeneous autonomous guided vehicle (MOSPHA-CP), considering both item correlation and priority constraints, a multi-objective optimization model was established. The model incorporated priority factors including penalty costs, customer credibility, order picking time requirements, item demand quantities, and customer grades. To efficiently solve this problem, an improved hybrid variable neighborhood search (HVNS) algorithm was proposed.A two-stage clustering combined with stochastic cost optimization mechanism was employed to generate high-quality initial solutions. A correlation-disruptive recombination mechanism was designed to perform neighborhood perturbations, and prevent the algorithm from premature convergence. Multiple neighborhood transformation operations were employed to execute a global search, and obtain higher-quality feasible solutions.Simulation experiments were conducted using IACO, GAVNS, and the improved HVNS algorithm.The effectiveness of the enhanced algorithm in solving MOSPHA-CP was validated by comparing performance metrics such as solution quality, convergence behavior, and Pareto front.The improved HVNS demonstrates a 30%–40% enhancement in solution quality compared to benchmark algorithms, while also exhibiting significant advantages in both convergence performance and Pareto front metrics, thereby validating its efficacy in solving MOSPHA-CP problems.

     

/

返回文章
返回