带时间窗的同时取送货车辆路径问题求解算法

    A Solution Algorithm for the Problem of Taking Delivery Vehicle Path at the Same Time with Time Window

    • 摘要: 为了整合物流配送过程的退货与送货服务,依据实际情况建立带时间窗的同时取送货车辆路径规划模型,设计一种基于K-means聚类处理的Q-Leaning自启发式蚁群算法解决此类问题。根据配送服务的特性,在基本的K-means算法上作相应的改进,同时提高蚁群算法的局部搜索能力,完成两算法的合理衔接。选用相关文献数据和标准算例进行实验,验证所提算法具有较好的性能,可以解决所描述的此类问题。

       

      Abstract: In order to integrate the return and delivery service in the process of logistics and distribution, a vehicle routing model with time window is established according to the actual situation, and a Q-learning self-heuristic ant colony algorithm based on K-means clustering processing is designed to solve such problems. According to the characteristics of distribution service, by improving the basic k-means algorithm, the local search ability of the ant colony algorithm is improved, and the reasonable connection of the two algorithms completed. Experiments are carried out according to the relevant literature data and standard examples to verify that the proposed algorithm has good performance and can solve the described problems.

       

    /

    返回文章
    返回