IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v74y2023i11p2391-2402.html
   My bibliography  Save this article

A semi-Lagrangian relaxation heuristic algorithm for the simple plant location problem with order

Author

Listed:
  • Xavier Cabezas
  • Sergio García

Abstract

The Simple Plant Location Problem with Order (SPLPO) is a variant of the Simple Plant Location Problem (SPLP) where the customers have preferences over the facilities that will serve them. In particular, customers define their preferences by ranking each of the potential facilities from the most preferred to the least preferred. Even though the SPLP has been widely studied in the literature, the SPLPO, which is a harder model to deal with, has been studied much less and the size of instances that can be solved is very limited. In this article, we study a Lagrangian relaxation of the SPLPO model and we show that some properties previously studied and exploited to develop efficient SPLP solution procedures can be extended for their use in solving the SPLPO. We propose a heuristic method that takes a Lagrangian relaxation solution as the starting point of a semi-Lagrangian relaxation algorithm. Finally, we include some computational studies to illustrate the good performance of this method, which quite often ends with the optimal solution.

Suggested Citation

  • Xavier Cabezas & Sergio García, 2023. "A semi-Lagrangian relaxation heuristic algorithm for the simple plant location problem with order," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(11), pages 2391-2402, November.
    • Handle: RePEc:taf:tjorxx:v:74:y:2023:i:11:p:2391-2402
    DOI: 10.1080/01605682.2022.2150573
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2022.2150573
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2022.2150573?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.

    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:taf:tjorxx:v:74:y:2023:i:11:p:2391-2402. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.