IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v37y2020i03ns0217595920500098.html
   My bibliography  Save this article

MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem

Author

Listed:
  • Naoto Katayama

    (Faculty of Distribution and Logistics Systems, Ryutsu Keizai University, Ibaraki, Japan)

Abstract

The fixed-charge capacitated multicommodity network design problem is a fundamental optimization problem arising in many network configurations. The solution of the problem provides an appropriate network design as well as routes of multicommodity flows aimed at minimizing the total cost, which is the sum of the flow costs and fixed-charge costs over a network with limited arc capacities. In the present paper, we introduce a combined approach with a capacity scaling procedure for finding an initial feasible solution and an MIP neighborhood search for improving the solutions. Besides, we modify the procedure for application to large-scale problems. Computational experiments demonstrate the effectiveness of the proposed approach, and high-quality solutions are obtained for two problem sets from the literature.

Suggested Citation

  • Naoto Katayama, 2020. "MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(03), pages 1-29, April.
    • Handle: RePEc:wsi:apjorx:v:37:y:2020:i:03:n:s0217595920500098
    DOI: 10.1142/S0217595920500098
    as

    Download full text from publisher

    File URL: https://www.worldscientific.com/doi/abs/10.1142/S0217595920500098
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595920500098?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.

    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:wsi:apjorx:v:37:y:2020:i:03:n:s0217595920500098. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.