Study on hybrid heuristic algorithm for multi-depot vehicle routing problem with hybrid picking-delivery strategy

摘要

With the rapid development of electronic commerce and logistics distribution, multi-depot vehicle routing problem with backhauls (MDVRPB) 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. Improved partially matched crossover operators can avoid destroying good gene parts during the course of crossover. According to the traditional genetic algorithm shortcomings of slowly convergent speed, the study adopts the strategy of protecting gene as whole, introduce adopts 2- exchange mutation operator. Secondly, stock elite adopting genetic algorithm with taboo searching algorithm to improve the convergent speed. This algorithm can offer the thought to settle the practical problem in scale. At the same time, it can be known that adopting hybrid picking-delivery strategy can save the distance of distribution route so as to improve economic benefit.