Solution algorithms for the capacitated single allocation hub location problem

A.T. Ernst and M. Krishnamoorthy

Annals of Operations Research, 1999, vol. 86, issue 0, 159 pages

Abstract: In this paper, we present an efficient approach for solving capacitated single allocationhub location problems. We use a modified version of a previous mixed integer linearprogramming formulation developed by us for p‐hub median problems. This formulationrequires fewer variables and constraints than those traditionally used in the literature. Wedevelop good heuristic algorithms for its solution based on simulated annealing (SA) andrandom descent (RDH). We use the upper bound to develop an LP‐based branch and boundsolution method. The problem, as we define it, finds applications in the design of postaldelivery networks, particularly in the location of capacitated mail sorting and distributioncentres. We test our algorithms on data obtained from this application. To the best of ourknowledge, this problem has not been solved in the literature. Computational results arepresented indicating the usefulness of our approach. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (59)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018994432663 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:86:y:1999:i:0:p:141-159:10.1023/a:1018994432663

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018994432663

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().