带时间窗约束的AGV集配货绿色路径规划问题研究

Research on green path planning of AGV pickup and delivery with time window constraints

  • 摘要: 针对柔性制造车间背景下带时间窗约束的自动化导引运输车(automated guided vehicle,AGV)集配货绿色路径规划问题,以最小化AGV集配货过程能耗及时间偏离能耗作为组合优化目标,构建AGV绿色车辆路径规划模型,根据所研究问题特性,提出了一种改进变邻域搜索的混合遗传算法(GA-VNS)对其进行求解,并设计了5种邻域结构来提高算法寻优能力。通过对Solomon算例测试集进行求解,并与国际已知最优解进行数据对比,验证文章所提算法的可行性;进一步以某柔性制造车间某一生产时段的AGV物流运输任务作为实验案例,分别使用所设计的算法、GA和VNS算法对问题进行求解,数值实验结果表明了文章所提模型及算法的优化、适用性,为车间实现节能减排的发展目标提供一种可行方案。

     

    Abstract: Aiming at the green path planning problem of picking and delivering automated guided vehicles (AGVs) with time windows constraints in the context of flexible manufacturing workshops, minimizing the energy consumption and time deviation energy consumption of AGV collection and distribution process as the combined optimization goal, the AGV green vehicle path planning model is constructed. According to the characteristics of the research problem, a hybrid genetic algorithm with improved variable neighborhood search (GA-VNS) is proposed to solve it, a series of five neighborhood structures are designed to improve the algorithm's optimization ability. The feasibility of the proposed algorithm in this paper is verified by solving the test set of Solomon benchmark and comparing the solution with the internationally best-known optimal solutions. Further, take the AGV logistics transportation task in a certain production period of a flexible manufacturing workshop as an experimental case, the algorithm designed in this paper, GA, and VNS algorithm are adopted respectively. Through a detailed analysis of experimental results, the optimization and applicability of the model and algorithm proposed in this paper are verified. It provides a feasible solution for the workshop to achieve the development goal of energy saving and emission reduction.

     

/

返回文章
返回