IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v86y1999i0p141-15910.1023-a1018994432663.html
   My bibliography  Save this article

Solution algorithms for the capacitated single allocation hub location problem

Author

Listed:
  • A.T. Ernst
  • M. Krishnamoorthy

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

Suggested Citation

  • A.T. Ernst & M. Krishnamoorthy, 1999. "Solution algorithms for the capacitated single allocation hub location problem," Annals of Operations Research, Springer, vol. 86(0), pages 141-159, January.
  • Handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:141-159:10.1023/a:1018994432663
    DOI: 10.1023/A:1018994432663
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018994432663
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1023/A:1018994432663?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:141-159:10.1023/a:1018994432663. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.