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

Mhand Hifi and Shohre Sadeghsa

Journal of the Operational Research Society, 2023, vol. 74, issue 1, 258-271

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.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2022.2035272 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:74:y:2023:i:1:p:258-271

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2022.2035272

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().