A tabu search algorithm for the min–max k-Chinese postman problem |
| |
Authors: | Dino Ahr Gerhard Reinelt |
| |
Affiliation: | Institute of Computer Science, University of Heidelberg, Im Neuenheimer Feld 368, 69120 Heidelberg, Germany |
| |
Abstract: | 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 improvement procedures in the course of the neighborhood construction. Furthermore, different neighborhoods are analyzed. Extensive computational results show that the tabu search algorithm outperforms all known heuristics and improvement procedures. |
| |
Keywords: | Arc routing Chinese postman problem Tabu search Min– max optimization |
本文献已被 ScienceDirect 等数据库收录! |
|