Subscription or Fee Access
A Hybrid Local Search for the Split Delivery Vehicle Routing Problem
In this paper we study the split delivery vehicle routing problem (SDVRP) which is a variant of the classical capacitated vehicle routing problem in which a customer’s demand can be split among several vehicles. For this NP-hard problem we show that there exists an optimal solution which can be encoded by a permutation of customers. As a result, we can divide the SDVRP into two subproblems: find the best permutation and find the best vehicle routes for an arbitrary permutation. These subproblems are NP-hard. Based on this approach, we design a hybrid metaheuristic which combines the Variable Neighborhood Decent and Stochastic Tabu Search methods for the first subproblem, and two fast decoding heuristics for the second subproblem. Computational results indicate that the proposed method is very competitive. It improves 23 best known solutions on the 95 available test instances with number of customers up to 288.
local search, metaheuristic, large neighborhood, diversification.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.