A general variable neighbourhood search for the commodity constrained split delivery vehicle routing problem Online publication date: Mon, 12-Jun-2023
by Mohamed Cheikh; Taicir Moalla Loukil
International Journal of Logistics Systems and Management (IJLSM), Vol. 45, No. 2, 2023
Abstract: The commodity constrained split delivery vehicle routing problem (C-SDVRP) is a relaxed version of the classical VRP. This problem emanates where customers request several commodities that can be delivered separately using a set of vehicles. With limited capacity, these vehicles can convey any mixed commodities set. More than one vehicle may visit one customer, and in each visit, each product must be delivered in its entirety. The objective is to minimise the total cost of the vehicle routes. To solve the C-SDVRP, we propose a general variable neighbourhood search (GVNS) that uses a random variable neighbourhood descent (RVND), in which we explore five neighbourhood structures. Computational experiments on large-sized instances show that the proposed approach finds several new best-known solutions, together with some improvement on the number of used vehicles. The results demonstrate that GVNS has a fast convergence rate and high computational accuracy.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook