基于Memetic算法的电子AGV路径规划

Research on Electronic AGV Routing Planning Based on Memetic Algorithm

电子AGV配送车辆的路径规划问题是工厂与车间调度的重要环节,基于遗传算法对电子AGV的工作路径规划问题进行了研究,提出了优化方案设计方法。在Matlab环境下,进行了算法实现与仿真,仿真结果表明,所提出的规划方案可以有效地降低配送过程中的车辆运行成本。

Abstract： Routing planning of electronic AGV delivery vehicle is a key point of factory and workshop plant scheduling. AGV routing planning problem is researched here based on Memetic algorithm, and design method is proposed for optimization scheme. Finally at MATLAB circumstance algorithm reali- zation and simulation is operated. Simulation results indicate that the presented planning scheme can re- duce the operating cost of delivery course effectively.