A tabu search algorithm for the min-max k-Chinese postman problem

@article{Ahr2006ATS,
  title={A tabu search algorithm for the min-max k-Chinese postman problem},
  author={Dino Ahr and Gerhard Reinelt},
  journal={Computers & OR},
  year={2006},
  volume={33},
  pages={3403-3422}
}
In this paper we present a tabu search algorithm for the min–max k-Chinese postman problem (MM k-CPP). Given an undirected edge-weighted graph and a distinguished depot node, the MM k-CPP consists of finding k > 1 tours (starting and ending at the depot node) such that each edge is traversed by at least one tour and the length of the longest tour is minimized. A special emphasis is put on investigating the trade-off between running time effort and solution quality when applying different… CONTINUE READING

Citations

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

A Balanced Route Design for Min-Max Multiple-Depot Rural Postman Problem (MMMDRPP): a police patrolling case

  • International Journal of Geographical Information Science
  • 2018
VIEW 9 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A Tabu Search Heuristic for the Prize-collecting Rural Postman Problem

  • Electr. Notes Theor. Comput. Sci.
  • 2011
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A Tabu Search Heuristic for the Prize-collecting Rural Postman Problem

BestSolution, CurrentSol
  • 2011
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Fast Failure Recovery for In-Band Controlled Multi-Controller OpenFlow Networks

  • 2018 International Conference on Information and Communication Technology Convergence (ICTC)
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

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

  • Journal on Vehicle Routing Algorithms
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

A Survey on Fault Management in Software-Defined Networks

  • IEEE Communications Surveys & Tutorials
  • 2017
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…