点击次数：

论文类型：会议论文

发表时间：2008-10-12

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

页面范围：6356-+

关键字：limited number of vehicles; time windows; multi-type vehicle; multi-depot; vehicle routing problem; genetic algorithm

摘要：According to the situation that modern large enterprise builds multiple depots and multi-type vehicles with the limited number are in the depots, multi-depot vehicle routing problem with time windows (MDVRPTW) where limited number of vehicles and multi-type vehicle limits is given. Mathematical model of the above problem is constructed, which reflects the feature of the multi-type vehicle limit and the limited number of vehicles, compatible with MDVRPTW. An improved chromosome representation is proposed on the basis of customer, which can denote the vehicle sent by depot, path and the customer unserviced. The genetic algorithm for the problem and the population initialization algorithm are constructed. A new handling constraint method based on genetic algorithm is designed, avoiding the difficulty of selecting the penalty factor in penalty strategy and making the handling constrain simplify. The validity of the algorithm to MDVRPTW with the above-mentioned conditions is proved by the experiments.