Transportation Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


TRANSPORTATION SCIENCE
Vol. 43, No. 1, February 2009, pp. 86-97
DOI: 10.1287/trsc.1080.0233
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by de Camargo, R. S.
Right arrow Articles by Luna, H. P. L.
Right arrow Search for Related Content

Benders Decomposition for Hub Location Problems with Economies of Scale

Ricardo Saraiva de Camargo, Gilberto de Miranda, Jr., Henrique Pacca L. Luna

Department of Applied and Exact Sciences, Federal University of Ouro Preto, João Monlevade, 35931-026, Minas Gerais, Brazil
Department of Industrial Engineering, Federal University of Minas Gerais, Pampulha, 30161-010, Belo Horizonte, Minas Gerais, Brazil
Computer Sciences Institute, Federal University of Alagoas, Campus A. C. Simões, Tabuleiro dos Martins, 57072-970, Maceió, Alagoas, Brazil

rcamargo{at}decea.ufop.br
miranda{at}dep.ufmg.br
pacca{at}tci.ufal.br

When considering hub-and-spoke networks with multiple allocation, the classical models of the literature compute solutions with large discount factors for small flows on interhub connections. Addressing the economies of scale issue, a tighter formulation for this problem is presented, bringing forward a special structure. A specialized version of Benders decomposition is then developed to solve large instances in reasonable time.

Key Words: hub-and-spoke networks; Benders decomposition; scale economies
History: Received: February 2007; revised: December 2007; accepted: December 2007.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2009 by INFORMS.