Given an undirected edge-weighted graph and a depot node, postman problems are generally concerned with traversing the edges of the graph (starting and ending at the depot node) while minimizing the distance traveled. For the Min-Max k-Chinese Postman Problem (MM k-CPP) we have k> 1 postmen and want to minimize the longest of the k tours. We present two new heuristics and improvement procedures for the MM k-CPP. Furthermore, we give three new lower bounds in order to assess the quality of the heuristics. Extensive computational results show that our algorithms outperform the heuristic of Frederickson et al. [12].
CITATION STYLE
Ahr, D., & Reinelt, G. (2002). New heuristics and lower bounds for the Min-Max k-chinese postman problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2461, pp. 64–74). Springer Verlag. https://doi.org/10.1007/3-540-45749-6_10
Mendeley helps you to discover research relevant for your work.