A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

@article{Archetti2006ATS,
  title={A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem},
  author={Claudia Archetti and Maria Grazia Speranza and Alain Hertz},
  journal={Transportation Science},
  year={2006},
  volume={40},
  pages={64-73}
}
We consider the Split Delivery Vehicle Routing Problem (SDVRP) where a fleet of homogeneous vehicles has to serve a set of customers. Each customer can be visited more than once, contrary to what is usually assumed in the classical Vehicle Routing Problem (VRP) and the demand of each customer can be greater than the capacity of the vehicles. No constraint on the number of available vehicles is considered. There is a single depot for the vehicles and each vehicle has to start and end its tour at… CONTINUE READING
Highly Influential
This paper has highly influenced 25 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 85 extracted citations

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Speranza, ”A direct trip algorithm for the k-split delivery vehicle routing problem

  • M.G.C. Archetti
  • Technical report n. 205,
  • 2002
1 Excerpt

Speranza, ”The split delivery vehicle routing problem with small capacity

  • C. Archetti, M.G.R. Mansini
  • Technical report n. 201,
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…