IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v9y2016i1p99-124.html
   My bibliography  Save this article

A new multi-objective model for a capacitated hub covering problem solving by two multi-objective evolutionary algorithms

Author

Listed:
  • Yamin Alizadeh
  • Reza Tavakkoli-Moghaddam
  • Sadoullah Ebrahimnejad

Abstract

This paper presents a new multi-objective mathematical model for a capacitated hub maximal covering problem (CHMCP) with the transfer flow and establishing costs of hubs that: 1) maximises hub covering; 2) minimises the cost of transportation and establishing hubs with c servers; 3) minimises the maximal capacity of hubs. So far, there has been little attention in the literature to consider all the foregoing objectives in one model simultaneously. Due to its complexity, this model is solved by two well-known multi-objective evolutionary algorithms; namely, non-dominated sorting genetic algorithm (NSGA-II) and non-dominated ranking genetic algorithm (NRGA). The computational results show that the proposed algorithms are usefulness and effectiveness to solve the presented model. In these algorithms, a penalty for the capacity violation is considered in order to control for the establishing cost of hubs. The comparison of the associated results is provided showing the NSGA-II outperforms the NRGA in terms of the solution quality and computational time for the most test problems. Finally, the remarkable conclusion is given.

Suggested Citation

  • Yamin Alizadeh & Reza Tavakkoli-Moghaddam & Sadoullah Ebrahimnejad, 2016. "A new multi-objective model for a capacitated hub covering problem solving by two multi-objective evolutionary algorithms," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 9(1), pages 99-124.
    • Handle: RePEc:ids:ijmore:v:9:y:2016:i:1:p:99-124
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=77559
    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:ijmore:v:9:y:2016:i:1:p:99-124. 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=320 .

    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.