An Efficient Heuristic for the k-Partitioning Problem

被引：0

作者：

Kalczynski P. ^{[1
]}

Goldstein Z. ^{[1
]}

Drezner Z. ^{[1
]}

机构：

[1] College of Business and Economics, California State University-Fullerton, Fullerton, 92834, CA

来源：

Operations Research Forum | / 4卷 / 4期

关键词：

Clusters; Heuristic; Location analysis; Starting solutions;

D O I：

10.1007/s43069-023-00249-w

中图分类号：

学科分类号：

摘要：

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. © 2023, The Author(s), under exclusive licence to Springer Nature Switzerland AG.

引用

共 50 条

[31] Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows
Chen, Di
Golin, Mordecai
ALGORITHMICA, 2023, 85 (07) : 1948 - 2000
[32] Lower bounds and modified LPT algorithm for k-partitioning problems with partition matroid constraint
Biao Wu
En-yu Yao
Applied Mathematics-A Journal of Chinese Universities, 2008, 23 : 1 - 8
[33] A MASSIVELY PARALLELIZABLE HEURISTIC METHOD FOR THE GRAPH PARTITIONING PROBLEM
MEUNIER, F
HIGH PERFORMANCE COMPUTING /, 1989, : 109 - 118
[34] Backbone analysis and heuristic design for the graph partitioning problem
Jiang, He
Qiu, Tie
Jisuanji Xuebao/Chinese Journal of Computers, 2009, 32 (08): : 1662 - 1667
[35] HEURISTIC OPTIMIZATION TECHNIQUES FOR SOLVING THE OPTIMAL PARTITIONING PROBLEM
Kasprikova, Nikola
7TH INTERNATIONAL DAYS OF STATISTICS AND ECONOMICS, 2013, : 570 - 577
[36] Efficient heuristic and tabu search for hardware/software partitioning
Wu, Jigang
Wang, Pu
Lam, Siew-Kei
Srikanthan, Thambipillai
JOURNAL OF SUPERCOMPUTING, 2013, 66 (01): : 118 - 134
[37] Efficient heuristic and tabu search for hardware/software partitioning
Jigang Wu
Pu Wang
Siew-Kei Lam
Thambipillai Srikanthan
The Journal of Supercomputing, 2013, 66 : 118 - 134
[38] An efficient heuristic for the ring star problem
Dias, Thayse Christine S.
de Sousa Filho, Gilberto F.
Macambira, Elder M.
Cabral, Lucidio dos Anjos F.
Fampa, Marcia Helena C.
EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2006, 4007 : 24 - 35
[39] An Efficient Heuristic for the Vacation Planning Problem
Gavalas, Damianos
Konstantopoulos, Charalampos
Pantziou, Grammati
Vathis, Nikolaos
2019 IEEE 10TH ANNUAL UBIQUITOUS COMPUTING, ELECTRONICS & MOBILE COMMUNICATION CONFERENCE (UEMCON), 2019, : 803 - 808
[40] A global method for the limited K-partitioning of hypergraphs representing optimal design problems in complex machine systems
Li Shuiping
Wan Xiaoxue
KYBERNETES, 2010, 39 (06) : 980 - 989

← 1 2 3 4 5 →