IDEAS home Printed from https://ideas.repec.org/a/igg/jsds00/v6y2015i1p17-32.html
   My bibliography  Save this article

A Variable Neighborhood Search Algorithm for Network Expansion Deferment in a Hub Network

Author

Listed:
  • Masoud Rabbani

    (School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran)

  • Amir Farshbaf-Geranmayeh

    (School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran)

  • Mohsen Hasani

    (School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran)

  • Mahyar Rezaei

    (School of Industrial EngineeringCollege of Engineering, University of Tehran, Tehran, Iran)

Abstract

The hub network expansion problem over planning horizon is addressed in this paper. In the extensive literature on hub network problem, it has widely been assumed that all P hub facilities must be located in current period and they do not take into account variation of demands, investment opportunities and net present cost. In this study, it is supposed that P hub facilities should have been located over planning horizon under variation of demands of every pair of nodes over time periods and also considering congestion effects at hub nodes. In this study, a mixed integer nonlinear programming formulation which minimizing the net present cost of planning horizon is presented. The Variable Neighborhood Search (VNS) algorithm is developed and successfully solved many instances of standard Childhood and Beyond (CAB) dataset and the results verify applicability of the proposed model and algorithm.

Suggested Citation

  • Masoud Rabbani & Amir Farshbaf-Geranmayeh & Mohsen Hasani & Mahyar Rezaei, 2015. "A Variable Neighborhood Search Algorithm for Network Expansion Deferment in a Hub Network," International Journal of Strategic Decision Sciences (IJSDS), IGI Global, vol. 6(1), pages 17-32, January.
    • Handle: RePEc:igg:jsds00:v:6:y:2015:i:1:p:17-32
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijsds.2015010102
    Download Restriction: no
    ---><---

    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:igg:jsds00:v:6:y:2015:i:1:p:17-32. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.