【摘要】 物流配送路径优化是现代物流配送服务的关键环节之一,由于需求的小批量和动态变化等特点,需要设计一个快速有效的求解算法。为此,构建了物流配送路径优化问题的数学模型,设计了一个改进的蚁群算法来求解该问题,引进了选择算子、插点操作和动态改变算法参数等改进措施,开发和实现了一个试验软件包。仿真试验结果表明,该算法具有较好的全局寻优能力,收敛速度快,是解决物流配送路径优化问题的有效算法。更多还原

【Abstract】 Vehicle Routing Problem(VRP) optimization is a very important problem in modern logistics service.Due to its small batch and dynamic changes of VRP,effective and fast algorithm to solve VRP was in great need.To deal with this need,a new mathematic model of logistics VRP was constructed and an improved Ant Colony Algorithm(ACA) for VRP with Time Window(VRPTW) was presented.To solve VRPTW with ACA,three improvements were introduced: interpolation operation,selection operator and dynamic change on algorithm parameters.An experimental program was developed and many computational studies were carried out.Simulation results showed that the improved ACA had better overall search ability and astringency.It was an effective solution to VRPTW.更多还原