A hybrid algorithm for the minimum bounding sphere problem

被引：2
|
作者：
Huang, Xiangyang [1 ]
Zhang, Shudong [1 ]
Zhou, Lijuan [1 ]
Huang, LiGuo [2 ]
机构：
[1] Capital Normal Univ, Coll Informat Engn, Beijing 100048, Peoples R China
[2] Southern Methodist Univ, Dept Comp Sci & Engn, Dallas, TX USA
来源：
OPERATIONS RESEARCH LETTERS | 2022年 / 50卷 / 02期
关键词：
Minimum bounding sphere; Minimum covering ball; Smallest enclosing ball;
D O I：
10.1016/j.orl.2022.01.013
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Two primal approaches, the shrinking approach and the dual approach, have been studied for the exact Minimum Bounding Sphere (MBS) problem. In this paper, we present a dual algorithm that uses the shrinking approach to solve subproblems. The experiments show our hybrid algorithm is faster than the dedicated shrinking algorithm and dual algorithm for solving the exact MBS problem in large point sets. (C) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页码：150 / 154
页数：5
相关论文
共 50 条
  • [1] The Minimum Latency Problem: A Hybrid Genetic Algorithm
    Ahmed, Zakir Hussain
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2018, 18 (11): : 153 - 158
  • [2] The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm
    Oncan, Temel
    Punnen, Abraham P.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (10) : 1762 - 1773
  • [3] A Hybrid Genetic Algorithm for the Minimum Interconnection Cut Problem
    Tang, Maolin
    Pan, Shenchen
    [J]. 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 3004 - 3011
  • [4] Hybrid bat algorithm for minimum dominating set problem
    Abed, Saad Adnan
    Rais, Helmi Md
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2017, 33 (04) : 2329 - 2339
  • [5] An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problem
    Hu, Bin
    Raidl, Guenther R.
    [J]. PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, : 393 - 400
  • [6] Hybrid Genetic Algorithm for Minimum Dominating Set Problem
    Hedar, Abdel-Rahman
    Ismail, Rashad
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2010, PT 4, PROCEEDINGS, 2010, 6019 : 457 - +
  • [7] MINIMUM COVERING SPHERE PROBLEM
    ELZINGA, DJ
    HEARN, DW
    [J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 19 (01): : 96 - 104
  • [8] Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
    Kim, Hyunjoon
    Kim, Byung-In
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 303 (02) : 550 - 566
  • [9] A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
    Lu, Yongliang
    Benlic, Una
    Wu, Qinghua
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2022, 144
  • [10] A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem
    Yuan, Fuyu
    Li, Chenxi
    Gao, Xin
    Yin, Minghao
    Wang, Yiyuan
    [J]. MATHEMATICS, 2019, 7 (03):
12345