Min-Max K-vehicles windy rural postman problem

@article{Benavent2009MinMaxKW,
  title={Min-Max K-vehicles windy rural postman problem},
  author={Enrique Benavent and {\'A}ngel Corber{\'a}n and Isaac Plana and Jos{\'e} Mar{\'i}a Sanchis},
  journal={Networks},
  year={2009},
  volume={54},
  pages={216-226}
}
In this paper the Min-Max version of the Windy Rural Postman Problem with several vehicles is introduced. For this problem, in which the objective is to minimize the length of the longest tour in order to find a set of balanced tours for the vehicles, we present here an ILP formulation and study its associated polyhedron. Based on its partial description, a branch-and-cut algorithm has been implemented and computational results on a large set of instances are finally presented. 
BETA

Similar Papers

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 23 CITATIONS

A metaheuristic for the min–max windy rural postman problem with K vehicles

VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Heuristics for the weighted k-rural postman problem with applications to urban snow removal

  • Journal on Vehicle Routing Algorithms
  • 2018
VIEW 2 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

A Branch-and-Cut Algorithm for the Undirected Capacitated Arc Routing Problem

G. Ghiani, D. Laganá, G. Laporte, R. Musmanno
  • Les Cahiers du GERARD, Université de Montréal, G-2007-39
  • 2007

Arc - Routing Problems , Part 2 : the Rural Postman Problem

M. Gendreau, G. Laporte
  • Operations Research
  • 1995