A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles

@inproceedings{Karaoglan2011ABA,
  title={A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles},
  author={Ismail Karaoglan},
  year={2011}
}
This study addresses the vehicle routing problem with multiple use of vehicles (VRPMUV) which is a variant of the classic vehicle routing problem (VRP). Unlike the classic VRP, vehicles are allowed to use more than one route in VRPMUV. In general, this problem arises in the home delivery of perishable goods where vehicle routes are short and they should be combined to form a working day. We propose a branch and cut algorithm for solving the VRPMUV. The proposed algorithm implements several… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

References

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

The vehicle routing problem. In: Combinatorial Optimization, 313–338

  • N. Christofides, A. Mingozzi, P. Toth
  • 1979
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…