 An improved Benders decomposition algorithm for the tree of hubs location problemElisangela Martins de Sá, Ricardo Saraiva de Camargo and Gilberto de Miranda European Journal of Operational Research, 2013, vol. 226, issue 2, 185-202 Abstract: The tree of hubs location problem is a particularly hard variant of the so called hub location problems. When solving this problem by a Benders decomposition approach, it is necessary to deal with both optimality and feasibility cuts. While modern implementations of the Benders decomposition method rely on Pareto-optimal optimality cuts or on rendering feasibility cuts based on minimal infeasible subsystems, a new cut selection scheme is devised here under the guiding principle of extracting useful information even when facing infeasible subproblems. The proposed algorithm outperforms two other modern variants of the method and it is capable of optimally solving instances five times larger than the ones previously reported on the literature. Keywords: Tree of hubs location problem; Hub-and-spoke networks; Benders decomposition method; Benders cuts selection scheme (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:226:y:2013:i:2:p:185-202 DOI: 10.1016/j.ejor.2012.10.051 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.