点击次数：

发布时间：2019-03-11

论文类型：会议论文

发表时间：2008-09-10

收录刊物：Scopus、CPCI-SSH、CPCI-S、EI

页面范围：128-133

关键字：clustering analysis; genetic algorithm; limited number of vehicles; vehicle routing problem with time windows

摘要：This paper improves the mathematical model for the vehicle routing problem with time windows where a limited number of vehicles is given, which not only reflects the feature of the limited number of vehicles in the depot, but also is compatible with VRPTW; redefines the distance between the customers used in the customer clustering, designs the customer clustering assignment algorithm, which can help achieve the initialization of the genetic algorithm and provides a new method for VRPTW customer clustering assignment; proposes an improved chromosome representation on the basis of customer, which can denote the different vehicle number sent by the depot and the customers unserviced; designs the genetic algorithm to solve m-VRPTW, and proves the validity of the algorithm by the experiments.