An Efficient Heuristic for the k-Partitioning Problem

Pawel Kalczynski (), Zvi Goldstein () and Zvi Drezner ()
Additional contact information
Pawel Kalczynski: California State University-Fullerton
Zvi Goldstein: California State University-Fullerton
Zvi Drezner: California State University-Fullerton

SN Operations Research Forum, 2023, vol. 4, issue 4, 1-21

Abstract: Abstract We investigate the k-partitioning problem, in which a set of items is divided into mutually exclusive and collectively exhaustive non-empty groups (clusters). The number of groups is given, and the distances between items, which may include weights, are defined. The sum of the distances between all members of the same group is calculated for each group, and the objective is to find the partition of the set of items that minimizes the sum of these individual sums. Two formulations of the problem are proposed and solved. In the first problem, the number of items in each group is given. In the second problem, there is no restriction on the number of items in each group. We propose an optimal algorithm for each of these two problems and an efficient heuristic algorithm that found all confirmed optimal solutions and improved several best-known solutions.

Keywords: Clusters; Heuristic; Starting solutions; Location analysis (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-023-00249-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:snopef:v:4:y:2023:i:4:d:10.1007_s43069-023-00249-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-023-00249-w

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().