Qiu, Meng and Fu, Zhuo and Eglese, Richard William and Tang, Qiong (2018) A Tabu Search algorithm for the vehicle routing problem with discrete split deliveries and pickups. Computers and Operations Research, 100. pp. 102-116. ISSN 0305-0548
TSforVRPDSPDP_Acepted_by_COR.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (1MB)
Abstract
The Vehicle Routing Problem with Discrete Split Deliveries and Pickups is a variant of the Vehicle Routing Problem with Split Deliveries and Pickups, in which customers’ demands are discrete in terms of batches (or orders). It exists in the practice of logistics distribution and consists of designing a least cost set of routes to serve a given set of customers while respecting constraints on the vehicles’ capacities. In this paper, its features are analyzed. A mathematical model and Tabu Search algorithm with specially designed batch combination and item creation operation are proposed. The batch combination operation is designed to avoid unnecessary travel costs, while the item creation operation effectively speeds up the search and enhances the algorithmic search ability. Computational results are provided and compared with other methods in the literature, which indicate that in most cases the proposed algorithm can find better solutions than those in the literature.