Journal of Heuristics

, Volume 16, Issue 3, pp 441–473

An adaptive memory algorithm for the split delivery vehicle routing problem

  • Rafael E. Aleman
  • Xinhui Zhang
  • Raymond R. Hill
Article

DOI: 10.1007/s10732-008-9101-3

Cite this article as:
Aleman, R.E., Zhang, X. & Hill, R.R. J Heuristics (2010) 16: 441. doi:10.1007/s10732-008-9101-3

Abstract

The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer demand. Split deliveries are used to reduce total fleet cost to meet those customer demands. We provide a detailed survey of the SDVRP literature and define a new constructive algorithm for the SDVRP based on a novel concept called the route angle control measure. We extend this constructive approach to an iterative approach using adaptive memory concepts, and then add a variable neighborhood descent process. These three new approaches are compared to exact and heuristic approaches by solving the available SDVRP benchmark problem sets. Our approaches are found to compare favorably with existing approaches and we find 16 new best solutions for a recent 21 problem benchmark set.

Keywords

Adaptive memory Vehicle routing Split delivery Route angle control Heuristic Variable neighborhood descent 

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Rafael E. Aleman
    • 1
  • Xinhui Zhang
    • 1
  • Raymond R. Hill
    • 2
  1. 1.BIE DepartmentWright State UniversityDaytonUSA
  2. 2.Air Force Institute of TechnologyWright-Patterson AFBDaytonUSA

Personalised recommendations