A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks

DOI10.1016/J.INS.2020.06.056MaRDI QIDQ2053830zbMATH OpenOpenAlexFDO

Authors Qing Zhou, Una Benlic, Qinghua Wu

Publication date 30 November 2021

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2020.06.056

zbMATH Keywords

clustering problemsheuristicsmemetic algorithmreformulation local search

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• J-means and I-means for minimum sum-of-squares clustering on networks
• Variable neighborhood search for minimum sum-of-squares clustering on networks
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• Design of hybrids for the minimum sum-of-squares clustering problem
• Sum-of-squares clustering on networks

Cites work

• A branch decomposition algorithm for the p-median problem
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• A hybrid heuristic for the \(p\)-median problem
• A hybrid metaheuristic method for the maximum diversity problem
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
• A new local search for continuous location problems
• A note on solving large p-median problems
• A tabu search based memetic algorithm for the Max-Mean dispersion problem
• An improved column generation algorithm for minimum sum-of-squares clustering
• An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
• Analysis of global k-means, an incremental heuristic for minimum sum-of-squares clustering
• Computational study of large-scale p-median problems
• Finite Dominating Sets for Network Location Problems
• scientific article; zbMATH DE number 1297592 (Why is no real title available?)
• Hybrid evolutionary search for the traveling repairman problem with profits
• J-means and I-means for minimum sum-of-squares clustering on networks
• J-MEANS: A new local search heuristic for minimum sum of squares clustering
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
• NP-hardness of Euclidean sum-of-squares clustering
• Sum-of-squares clustering on networks
• The University of Florida sparse matrix collection
• TSPLIB—A Traveling Salesman Problem Library
• Using injection points in reformulation local search for solving continuous location problems
• Variable neighborhood search for minimum sum-of-squares clustering on networks
• Variable neighborhood search for the p-median

Cited in

(3)

• Variable neighborhood search for minimum sum-of-squares clustering on networks
• J-means and I-means for minimum sum-of-squares clustering on networks
• Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering

Describes a project that uses

Uses Software

• SparseMatrix
• TSPLIB
• J-MEANS
• Tabu search
• irace
• OR-Library

This page was built for publication: A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053830)