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-2026-232823
If you've NEVER registered a DOI in your Lattes, check our tutorial!This work addresses the Ring Hierarchical Hub Network Design Problem, which combines hierarchical allocation decisions with a ring structure connecting central hubs. The problem is computationally challenging due to its combinatorial nature and the interaction between location, allocation, and routing decisions. Motivated by the limited number of formulations available in the literature, this study proposes improvements to an existing mixed-integer linear programming model. The approach introduces reformulations and valid inequalities that reduce structural redundancies and enhance computational performance. Computational experiments on instances from the USA423 dataset demonstrate consistent performance gains. In instances where both models reach optimality, the proposed formulation reduces total solution time by 18.59%, and is also able to find high-quality feasible solutions in cases where the original model fails. The results highlight the effectiveness of the proposed formulation, particularly for larger instances.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
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