Can I read Tabu Search for Min-Max k-CPP on EtoBox?

Tabu Search for Min-Max k-CPP by pc2010 is a document available to read on EtoBox.

What is Tabu Search for Min-Max k-CPP about?

The document describes a tabu search algorithm for solving the min-max k-Chinese postman problem (MM k-CPP). The MM k-CPP involves finding k tours starting and ending at a depot node to service all edges in a network such that the longest tour is minimized. The tabu search algorithm uses procedures to modify and improve individual tours and explores different neighborhood structures. Computational results show the tabu search algorithm outperforms existing heuristics and often finds near-optimal or optimal

Author

pc2010

Language

EN