A general variable neighbourhood search for the commodity constrained split delivery vehicle routing problem

Mohamed Cheikh and Taicir Moalla Loukil

International Journal of Logistics Systems and Management, 2023, vol. 45, issue 2, 249-267

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.

Keywords: vehicle routing problem; multiple commodities; split delivery; metaheuristics; variable neighbourhood search. (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=131421 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijlsma:v:45:y:2023:i:2:p:249-267

Access Statistics for this article

More articles in International Journal of Logistics Systems and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().