IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v14y2013i2p221-235.html
   My bibliography  Save this article

Simulated annealing-based algorithm for the capacitated hub routing problem

Author

Listed:
  • P.N. Ram Kumar
  • Appa Iyer Sivakumar

Abstract

Routing traffic across a capacitated hub-and-spoke network is very common in freight transportation and telecommunications. Most of the hub-and-spoke network models available in the literature assume a fully inter-connected hub network and allow traffic to pass through a maximum of two hubs. In the absence of a fully inter-connected hub network, the traffic may have to be routed through more than two hubs. In this paper, we develop a mathematical model and a simulated annealing (SA)-based solution methodology for routing freight through not more than three hubs in a given capacitated network. We generate test problem instances to evaluate the efficacy of the mathematical model and the meta-heuristic procedure. The effect of each network parameter on the performance of the SA procedure is analysed thoroughly with extensive computational experiments and relevant statistical tests. The results show that near-optimal solutions for large problem instances can be derived in little computational time.

Suggested Citation

  • P.N. Ram Kumar & Appa Iyer Sivakumar, 2013. "Simulated annealing-based algorithm for the capacitated hub routing problem," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 14(2), pages 221-235.
    • Handle: RePEc:ids:ijsoma:v:14:y:2013:i:2:p:221-235
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=51830
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijsoma:v:14:y:2013:i:2:p:221-235. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=150 .

    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.