New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem

Authors:
Dino Ahr;Gerhard Reinelt
Affiliations:
-;-
Venue:
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Year:
2002

Citing 3
Cited 1

Improvement Procedures for the Undirected Rural Postman Problem

INFORMS Journal on Computing
A Tabu Search Heuristic for the Capacitated Arc Routing Problem

Operations Research
Solution of a Min-Max Vehicle Routing Problem

INFORMS Journal on Computing

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

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.