New Lower Bounds and Exact Method for the m-PVRP

@article{Ngueveu2013NewLB,
  title={New Lower Bounds and Exact Method for the m-PVRP},
  author={Sandra Ulrich Ngueveu and C. Prins and R. W. Calvo},
  journal={Transp. Sci.},
  year={2013},
  volume={47},
  pages={38-52}
}
This paper presents new lower bounding procedures and an exact method for the m-peripatetic vehicle routing problem m-PVRP based on polyhedral and column generation approaches. The branch-and-cut algorithms use three types of valid cuts on the edge-based formulation. The column-generation-based lower bounding procedure is applied on the dual set partitioning formulation and is composed of dual heuristics that estimate good dual variable values and therefore high lower bounds. Computational… Expand
5 Citations

References

SHOWING 1-10 OF 18 REFERENCES
Models, relaxations and exact approaches for the capacitated vehicle routing problem
  • 941
  • PDF
The vehicle routing problem
  • 2,657
A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem
  • 31
  • PDF
On the symmetric travelling salesman problem I: Inequalities
  • 214
...
1
2
...