IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v122y2003i1p193-21710.1023-a1026102724889.html
   My bibliography  Save this article

A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements

Author

Listed:
  • Bernard Gendron
  • Jean-Yves Potvin
  • Patrick Soriano

Abstract

In this paper, a tabu search heuristic is combined with slope scaling to solve a discrete depot location problem, known as the multicommodity location problem with balancing requirements. Although the uncapacitated version of this problem has already been addressed in the literature, this is not the case for the more challenging capacitated version, where each depot has a fixed and finite capacity. The slope scaling approach is used during the initialization phase to provide the tabu search with good starting solutions. Numerical results are reported on various types of large-scale randomly generated instances. The quality of the heuristic is assessed by comparing the solutions obtained with those of a commercial mixed-integer programming code. Copyright Kluwer Academic Publishers 2003

Suggested Citation

  • Bernard Gendron & Jean-Yves Potvin & Patrick Soriano, 2003. "A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements," Annals of Operations Research, Springer, vol. 122(1), pages 193-217, September.
    • Handle: RePEc:spr:annopr:v:122:y:2003:i:1:p:193-217:10.1023/a:1026102724889
    DOI: 10.1023/A:1026102724889
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1026102724889
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1026102724889?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. Noor-E-Alam, Md. & Mah, Andrew & Doucette, John, 2012. "Integer linear programming models for grid-based light post location problem," European Journal of Operational Research, Elsevier, vol. 222(1), pages 17-30.
    2. Weili Zhang & Charles D. Nicholson, 2020. "Objective scaling ensemble approach for integer linear programming," Journal of Heuristics, Springer, vol. 26(1), pages 1-19, February.
    3. Li, Jinfeng & Chu, Feng & Prins, Christian & Zhu, Zhanguo, 2014. "Lower and upper bounds for a two-stage capacitated facility location problem with handling costs," European Journal of Operational Research, Elsevier, vol. 236(3), pages 957-967.
    4. Michel Vasquez & Mirsad Buljubasic & Saïd Hanafi, 2023. "An efficient scenario penalization matheuristic for a stochastic scheduling problem," Journal of Heuristics, Springer, vol. 29(2), pages 383-408, June.
    5. Moon, Ilkyeong & Do Ngoc, Anh-Dung & Konings, Rob, 2013. "Foldable and standard containers in empty container repositioning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 107-124.

    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:spr:annopr:v:122:y:2003:i:1:p:193-217:10.1023/a:1026102724889. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.