摘要
为了提高物流配送效率,减少运输车辆运营成本,基于共同配送的理念,提出基于客户共享的车辆路径问题研究,其本质是多配送中心车辆路径问题,为提高客户满意度,加上软时间窗条件约束,并构造相应的数学模型。在解决该问题时,首先运用k-means算法进行聚类处理,其次采用结合2-opt的多态蚁群算法对其子问题求最优解,该方法明显提升了算法的收敛速度。最后,列举实例证实了具有聚类的多态蚁群算法的可行性和有效性。
In order to improve the efficiency of logistics distribution and reduce the operating cost of transportation vehicles,based on the concept of common distribution,the research on vehicle routing problem based on customer sharing is proposed. The essence of the problem is the multi-distribution center vehicle routing problem,in order to improve customer satisfaction and soft time window conditions. Constrain and construct the corresponding mathematical model. In solving this problem,the k-means algorithm is first used for clustering processing. Secondly,the multi-state ant colony algorithm combined with 2-opt is used to find the optimal solution for the sub-problem. This method significantly improves the convergence speed of the algorithm. Finally,the examples demonstrate the feasibility and effectiveness of a polymorphic ant colony algorithm with clustering.
作者
文军
WEN Jun(Lanzhou Jiaotong University,Lanzhou 730070,China)
出处
《物流工程与管理》
2019年第1期56-58,27,共4页
Logistics Engineering and Management
关键词
车辆路径问题
K-MEANS聚类算法
多态蚁群算法
vehicle routing problem
k-means clustering algorithm
polymorphic ant colony algorithm
