IDEAS home Printed from https://ideas.repec.org/a/ids/ijlsma/v43y2022i2p177-192.html
   My bibliography  Save this article

A genetic algorithm for integrated hub covering-routing problem considering forbidden paths

Author

Listed:
  • Ashkan Ayough
  • Behrooz Khorshidvand
  • Fatemeh Adibrad

Abstract

In this study, a new mathematical model is provided for the hub covering-routing problem (HCRP) through an extension of the travelling salesman problem (TSP). The objective of HCRP is to minimise the total related costs. This model assumes that if existence nodes are at a certain distance from a given node, they will be covered. The problem is a complete graph, so the seller must enter and leave once on each node. The main decision variables are to determine the tours and how to use the hubs in the way that total cost can be minimised. Since the proposed model is NP-hard, a genetic algorithm (GA) is developed for solving the model in real-world sizes. The results show that the proposed model and solution method are useful for dealing with real-world problems. The computational results show that in large-scale instances, GA solves the problem in a reasonable CPU time where GAMS is unable to find even a feasible solution. The average running time of GA is 62.69 seconds for large scale instances.

Suggested Citation

  • Ashkan Ayough & Behrooz Khorshidvand & Fatemeh Adibrad, 2022. "A genetic algorithm for integrated hub covering-routing problem considering forbidden paths," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 43(2), pages 177-192.
    • Handle: RePEc:ids:ijlsma:v:43:y:2022:i:2:p:177-192
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=126014
    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:ijlsma:v:43:y:2022:i:2:p:177-192. 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=134 .

    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.