IDEAS home Printed from https://ideas.repec.org/a/eme/jamrpp/jamr-11-2018-0107.html
   My bibliography  Save this article

Application of variable neighborhood search for solving large-scale many to many hub location routing problems

Author

Listed:
  • Mehdi Abbasi
  • Nahid Mokhtari
  • Hamid Shahvar
  • Amin Mahmoudi

Abstract

Purpose - The purpose of this paper is to solve large-scale many-to-many hub location-routing problem (MMHLRP) using variable neighborhood search (VNS). The MMHLRP is a combination of a single allocation hub location and traveling salesman problems that are known as one of the new fields in routing problems. MMHLRP is considered NP-hard since the two sub-problems are NP-hard. To date, only the Benders decomposition (BD) algorithm and the variable neighborhood particle swarm optimization (VNPSO) algorithm have been applied to solve the MMHLRP model with ten nodes and more (up to 300 nodes), respectively. In this research, the VNS method is suggested to solve large-scale MMHLRP (up to 1,000 nodes). Design/methodology/approach - Generated MMHLRP sample tests in the previous work were considered and were added to them. In total, 35 sample tests of MMHLRP models between 10 and 1,000 nodes were applied. Three methods (BD, VNPSO and VNS algorithms) were run by a computer to solve the generated sample tests of MMHLRP. The maximum available time for solving the sample tests was 6 h. Accuracy (value of objective function solution) and speed (CPU time consumption) were considered as two major criteria for comparing the mentioned methods. Findings - Based on the results, the VNS algorithm was more efficient than VNPSO for solving the MMHLRP sample tests with 10–440 nodes. It had many similarities with the exact BD algorithm with ten nodes. In large-scale MMHLRP (sample tests with more than 440 nodes (up to 1,000 nodes)), the previously suggested methods were disabled to solve the problem and the VNS was the only method for solving samples after 6 h. Originality/value - The computational results indicated that the VNS algorithm has a notable efficiency in comparison to the rival algorithm (VNPSO) in order to solve large-scale MMHLRP. According to the computational results, in the situation that the problems were solved for 6 h using both VNS and VNPSO, VNS solved the problems with more accuracy and speed. Additionally, VNS can only solve large-scale MMHLRPs with more than 440 nodes (up to 1,000 nodes) during 6 h.

Suggested Citation

  • Mehdi Abbasi & Nahid Mokhtari & Hamid Shahvar & Amin Mahmoudi, 2019. "Application of variable neighborhood search for solving large-scale many to many hub location routing problems," Journal of Advances in Management Research, Emerald Group Publishing Limited, vol. 16(5), pages 683-697, May.
    • Handle: RePEc:eme:jamrpp:jamr-11-2018-0107
    DOI: 10.1108/JAMR-11-2018-0107
    as

    Download full text from publisher

    File URL: https://www.emerald.com/insight/content/doi/10.1108/JAMR-11-2018-0107/full/html?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://www.emerald.com/insight/content/doi/10.1108/JAMR-11-2018-0107/full/pdf?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1108/JAMR-11-2018-0107?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.

    Citations

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


    Cited by:

    1. Zhiyuan Yuan & Jie Gao, 2022. "Dynamic Uncertainty Study of Multi-Center Location and Route Optimization for Medicine Logistics Company," Mathematics, MDPI, vol. 10(6), pages 1-15, March.

    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:eme:jamrpp:jamr-11-2018-0107. 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: Emerald Support (email available below). General contact details of provider: .

    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.