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

A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem

Author

Listed:
  • Mhand Hifi
  • Shohre Sadeghsa

Abstract

In logistics, completion problems can arise in batching a group of distribution warehouses. It is often preferable to group orders from different customers into a pick batch (cluster), where all requested orders must be collected. This problem occurs when combining multiple orders from a single customer into a single pick order. Therefore, this study aims to investigate a variant of this problem: the k-clustering minimum bi-clique completion problem. For this purpose, a hybrid algorithm is designed to solve it, where both rounding strategy and augmented local search cooperate for highlighting the quality of the solutions achieved. The performance of the proposed method is evaluated on a set of benchmark instances taken from the literature, where its provided results (bounds) are compared to those achieved by the best method available in the literature. New bounds are obtained.

Suggested Citation

  • Mhand Hifi & Shohre Sadeghsa, 2023. "A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(1), pages 258-271, January.
    • Handle: RePEc:taf:tjorxx:v:74:y:2023:i:1:p:258-271
    DOI: 10.1080/01605682.2022.2035272
    as

    Download full text from publisher

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