A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem

@inproceedings{Campos2007ASS,
  title={A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem},
  author={Campos and A. Corber{\'a}n and Mota},
  year={2007}
}
In this paper we present a metaheuristic procedure constructed for the special case of the Vehicle Routing Problem in which the demands of the clients can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The results obtained compare with the best results known up to date on a set of instances previously published in the literature. 
7 Citations
17 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Scheduling of vehicles from a central depot to a number of delivery points

  • G. Clarke, J. V. Wright
  • Operations Research 12
  • 1964
Highly Influential
4 Excerpts

Scatter Search – Methodology and implementations in C

  • M. Laguna, R. Martí
  • Kluwer Academic Publishers, Boston
  • 2003
1 Excerpt

A practical approach to solving a newspaper logistic problem using a digital map

  • S. Song, K. Lee, G. Kim
  • Comput. Ind. Eng. 43
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…