A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints

@article{Contardo2014ANE,
  title={A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints},
  author={Claudio Contardo and Rafael Martinelli},
  journal={Discrete Optimization},
  year={2014},
  volume={12},
  pages={129-146}
}
This article presents an exact algorithm for the multi-depot vehicle routing problem (MDVRP) under capacity and route length constraints. The MDVRP is formulated using a vehicle-flow and a set-partitioning formulation, both of which are exploited at different stages of the algorithm. The lower bound computed with the vehicle-flow formulation is used to eliminate non-promising edges, thus reducing the complexity of the pricing subproblem used to solve the set-partitioning formulation. Several… CONTINUE READING
Highly Cited
This paper has 57 citations. REVIEW CITATIONS
34 Citations
31 References
Similar Papers

Citations

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

57 Citations

01020'13'14'15'16'17'18
Citations per Year
Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.

References

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

Wolfler-Calvo. A branchand-cut algorithm for the capacitated location routing problem

  • J. M. Belenguer, E. Benavent, C. Prins, C. Prodhon
  • Computers & Operations Research,
  • 2011
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…