A Quality and Distance Guided Metaheuristic Algorithm for Vertex Separation Problem

This paper presents a quality and distance guided metaheuristic algorithm (QD-ILS) for solving the vertex separation problem. QD-ILS integrates a basic local search procedure with QD-LS strategy, which uses an augmented evaluation function that considers both solution quality and distance between th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE access 2017-01, Vol.5, p.19248-19258
Hauptverfasser:	Ding, Junwen, Zhou, Taoqing, Lu, Zhipeng, Yuan, Yujin
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm design and analysis Algorithms Approximation algorithms Benchmark testing Benchmarks Clustering algorithms Heuristic methods hybrid metaheuristic algorithm Layout Linear programming quality and distance guided local search Search problems Searching Separation Vertex separation problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!