A multistart heuristic for the equality generalized traveling salesman problem

@article{Cacchiani2011AMH,
  title={A multistart heuristic for the equality generalized traveling salesman problem},
  author={Valentina Cacchiani and Albert Einstein Fernandes Muritiba and Marcos Negreiros and Paolo Toth},
  journal={Networks},
  year={2011},
  volume={57},
  pages={231-239}
}
We study the equality generalized traveling salesman problem (E-GTSP), which is a variant of the well-known traveling salesman problem. We are given an undirected graph G = (V,E), with set of vertices V and set of edges E, each with an associated cost. The set of vertices is partitioned into clusters. E-GTSP is to find an elementary cycle visiting exactly one vertex for each cluster and minimizing the sum of the costs of the traveled edges. We propose a multistart heuristic, which iteratively… CONTINUE READING
4
Twitter Mentions