IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v25y2017i4p460-477.html
   My bibliography  Save this article

A simulated annealing algorithm for solving multi-depot location routing problem with backhaul

Author

Listed:
  • Mahsa Oroojeni Mohammad Javad
  • Behrooz Karimi

Abstract

This paper presents a method for solving a multi-depot location-routing problem with backhaul (MDLRPB). In the suggested problem, there are two subsets of customers including linehaul and backhaul customers. Linehaul customers require a delivery of stock from the depot, whereas backhaul customers need to deliver stock from their location to the depot. A mathematical model and a heuristic method based on the simulated annealing (SA) algorithm have been proposed for solving the problem. Test problems from the literature have been used for generating a new test problem for the MDLRPB problem. Computational results show that the CPU time for the SA is reasonable while this value for the LINGO increase dramatically in large size problems. In the worst case, the gap between objective function value of SA algorithm and optimal solution is equal 3%. The results indicate that suggested algorithm can reach the optimal or near optimal solution in small and medium size problems in a reasonable computational time.

Suggested Citation

  • Mahsa Oroojeni Mohammad Javad & Behrooz Karimi, 2017. "A simulated annealing algorithm for solving multi-depot location routing problem with backhaul," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 25(4), pages 460-477.
    • Handle: RePEc:ids:ijisen:v:25:y:2017:i:4:p:460-477
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=83043
    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.

    Citations

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


    Cited by:

    1. Heilig, Leonard & Lalla-Ruiz, Eduardo & Voß, Stefan, 2017. "Multi-objective inter-terminal truck routing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 178-202.
    2. Khalid Mekamcha & Mehdi Souier & Hakim Nadhir Bessenouci & Mohammed Bennekrouf, 2021. "Two metaheuristics approaches for solving the traveling salesman problem: an Algerian waste collection case," Operational Research, Springer, vol. 21(3), pages 1641-1661, September.

    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:ijisen:v:25:y:2017:i:4:p:460-477. 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=188 .

    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.