A multiple search operator heuristic for the max-k-cut problem - Université d'Angers Accéder directement au contenu
Article Dans Une Revue Annals of Operations Research Année : 2017

A multiple search operator heuristic for the max-k-cut problem

Résumé

The max-k-cut problem is to partition the vertices of an edge-weighted graph G=(V,E) into k≥2 disjoint subsets such that the weight sum of the edges crossing the different subsets is maximized. The problem is referred as the max-cut problem when k=2. In this work, we present a multiple operator heuristic (MOH) for the general max-k-cut problem. MOH employs five distinct search operators organized into three search phases to effectively explore the search space. Experiments on two sets of 91 well-known benchmark instances show that the proposed algorithm is highly effective on the max-k-cut problem and improves the current best known results (lower bounds) of most of the tested instances for k∈[3,5]. For the popular special case k=2 (i.e., the max-cut problem), MOH also performs remarkably well by discovering 4 improved best known results. We provide additional studies to shed light on the key ingredients of the algorithm.

Fichier principal
Vignette du fichier
mahaoaor2016.pdf (379.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01413256 , version 1 (09-12-2016)
hal-01413256 , version 2 (04-06-2017)

Identifiants

Citer

Fuda Ma, Jin-Kao Hao. A multiple search operator heuristic for the max-k-cut problem. Annals of Operations Research, 2017, 248, pp.365-403. ⟨10.1007/s10479-016-2234-0⟩. ⟨hal-01413256v2⟩

Collections

UNIV-ANGERS LERIA
100 Consultations
462 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More