172
Views
32
CrossRef citations to date
0
Altmetric
Theoretical Paper

Local search-based metaheuristics for the split delivery vehicle routing problem

, &
Pages 1356-1364 | Received 01 Nov 2008, Accepted 01 Jun 2009, Published online: 21 Dec 2017
 

Abstract

The split delivery vehicle routing problem is a variant of the standard vehicle routing problem where the single-visit assumption is waived and a customer might be served on more than one vehicle tour. In this article we report on a study where we have applied the standard local search-based metaheuristics using adaptations of the most widely used inter-tour and intra-tour exchange operators for solving the standard vehicle routing problem now allowing splitting and joining of deliveries. As we will show we could find new best solutions for 51 out of 57 benchmark instances, which have been defined for this problem class.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 277.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.