Minimum Spanning Tree-based Clustering of Large Pareto Archives

被引：0
作者：
Jaszkiewicz, Andrzej [1 ]
机构：
[1] Poznan Univ Tech, Fac Comp, Poznan, Poland
来源：
PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION) | 2019年
关键词：
Multiobjective optimization; clustering;
D O I：
10.1145/3319619.3326883
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper we propose the use of Minimum Spanning Tree-based clustering to recursively cluster large sets of potentially Pareto-optimal solutions. We present preliminary results for the multi-objective traveling salesperson problem. The clustering is based on the distances between solutions defined in the decision space but it generates clusters that correspond to clearly defined regions in the objective space.
引用
收藏
页码：1252 / 1253
页数：2
相关论文
共 14 条
  • [1] On the Complexity of Computing the Hypervolume Indicator
    Beume, Nicola
    Fonseca, Carlos M.
    Lopez-Ibanez, Manuel
    Paquete, Luis
    Vahrenhold, Jan
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (05) : 1075 - 1082
  • [2] Using unconstrained elite archives for multiobjective optimization
    Fieldsend, JE
    Everson, RM
    Singh, S
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (03) : 305 - 323
  • [3] Grygorash O, 2006, PROC INT C TOOLS ART, P73
  • [4] ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem
    Jaszkiewicz, Andrzej
    Lust, Thibaut
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (05) : 778 - 791
  • [5] Many-Objective Pareto Local Search
    Jaszkiewicz, Andrzej
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 271 (03) : 1001 - 1013
  • [6] Improved quick hypervolume algorithm
    Jaszkiewicz, Andrzej
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 90 : 72 - 83
  • [7] Jaszkiewicz Andrzej, 2008, Interactive Multiobjective EvoAlgorithms, P179, DOI [10.1007/978-3-540-88908-3_7, DOI 10.1007/978-3-540-88908-3_7]
  • [8] Fast approximate minimum spanning tree based clustering algorithm
    Jothi, R.
    Mohanty, Sraban Kumar
    Ojha, Aparajita
    [J]. NEUROCOMPUTING, 2018, 272 : 542 - 557
  • [9] Speed-up techniques for solving large-scale biobjective TSP
    Lust, T.
    Jaszkiewicz, A.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (03) : 521 - 533
  • [10] Two-phase Pareto local search for the biobjective traveling salesman problem
    Lust, Thibaut
    Teghem, Jacques
    [J]. JOURNAL OF HEURISTICS, 2010, 16 (03) : 475 - 510
12