IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v2y2011i4p13-28.html
   My bibliography  Save this article

A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design

Author

Listed:
  • Masoud Yaghini

    (Iran University of Science and Technology, Iran)

  • Mohammad Karimi

    (Iran University of Science and Technology, Iran)

  • Mohadeseh Rahbar

    (Iran University of Science and Technology, Iran)

  • Rahim Akhavan

    (Kermanshah University of Technology, Kermanshah, Iran)

Abstract

The fixed-cost Capacitated Multicommodity Network Design (CMND) problem is a well known NP-hard problem. This paper presents a matheuristic algorithm combining Simulated Annealing (SA) metaheuristic and Simplex method for CMND problem. In the proposed algorithm, a binary array is considered as solution representation and the SA algorithm manages open and closed arcs. Several strategies for opening and closing arcs are proposed and evaluated. In this matheuristic approach, for a given design vector, CMND becomes a Capacitated Multicommodity minimum Cost Flow (CMCF) problem. The exact evaluation of the CMCF problem is performed using the Simplex method. The parameter tuning for the proposed algorithm is done by means of design of experiments approach. The performance of the proposed algorithm is evaluated by solving different benchmark instances. The results of the proposed algorithm show that it is able to obtain better solutions in comparison with previous methods in the literature.

Suggested Citation

  • Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar & Rahim Akhavan, 2011. "A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 2(4), pages 13-28, October.
    • Handle: RePEc:igg:jamc00:v:2:y:2011:i:4:p:13-28
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar & Mohammad Hassan Sharifitabar, 2015. "A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 48-58, February.

    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:jamc00:v:2:y:2011:i:4:p:13-28. 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.