Research on Multi-vehicle and Multi-depot Vehicle Routing Problem with Time Windows for Electronic Commerce

With the rapid development of electronic commerce and logistics distribution, multi-depot vehicle routing problem with time windows (MDVRPTW) as influencing electronic commerce more step development, has been paid more attentions. According to the characteristics of model, hybrid heuristic algorithm is used to get the optimization solution. First of all, use hybrid coding so as to simplify the problem, construct the pertinence of initial solution to enhance the feasibility of solutions. Secondly, using the best retain select method to ensure the diversity of groups. Improved ordinal crossover operators can avoid destroying good gene parts during the course of ordinal crossover. Adopt partial route overturn mutation operator to improve convergent speed. In the end, the test proves the validity of this improved algorithm combining with examples.