This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2025-212503
If you've NEVER registered a DOI in your Lattes, check our tutorial!This paper proposes a Benders decomposition-based algorithm to solve the Two-Level Generalized Median Tour Problem (TLGMTP), which models hierarchical distribution systems partitioned into clusters. The algorithm incorporates modern acceleration techniques, such as the two-phase approach, the use of a single branch-and-bound tree, normalized subproblems, and the addition of valid inequalities. Computational experiments conducted on 32 instances with up to 417 nodes from the GTSP-Lib demonstrate the effectiveness of the proposed approach: all instances were solved to optimality, with an average solution time of only 395.69 seconds. This represents a significant improvement over the original work method, which presented average GAPS of 3.10%, and over the CPLEX automatic Benders decomposition, which presented average GAPS of 0.08%. The results confirm that the proposed method is robust, efficient, and promising for network design problems with hierarchical structure and fixed costs.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper