On the application of the vehicle routing problem with multi-distribution centers in reverse logistics

Abstract

This paper aims at the situation that customers' recovery requirements have been seldom considered on the vehicle routing problem with multi-distribution centers in logistics delivery, integrating reverse logistics on the basis of forward logistics delivery to research the process of simultaneous delivery and recovery. The nearest distance rules is proposed to distribute the customer nodes, so that the problem of multi-distribution centers can be transformed into a single distribution center problem. At the same time, considering feasible paths between nodes cannot be entirely guaranteed in real life, the model is proposed that nodes can be accessed multiple times but can only be served once. This paper employs the artificial bee colony algorithm to obtain the optimal vehicle path with the optimal total transportation cost. Finally, the validity and practical application value of both model and algorithm is verified with a numerical example.