Spreading Points Using Gradient and Tabu
Xiangyang Huang () and
LiGuo Huang
Additional contact information
Xiangyang Huang: Capital Normal University
LiGuo Huang: Southern Methodist University
SN Operations Research Forum, 2023, vol. 4, issue 2, 1-11
Abstract:
Abstract Large spreading (packing) problems are hard to be solved exactly. Consequently, heuristic approaches are usually used to find approximate solutions. In this paper, a hybrid heuristic method, consisting of a Neighborhood Tabu (NT) and a Perturbed Gradient (PG), is proposed for solving spreading points problems. NT applies an adaptive random technique to selecting promising candidate solutions from the neighborhood of the current local minimum and PG uses a neighborhood-based perturbed gradient algorithm to seek a better minimum, starting from the candidates. Two procedures work alternatively and cooperatively. When applied to some previously studied packings, the proposed method can improve the accuracy of the previous record solutions.
Keywords: Spreading; Packing; Minimum enclosing ball; Gradient; Tabu search (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s43069-023-00214-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:snopef:v:4:y:2023:i:2:d:10.1007_s43069-023-00214-7
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069
DOI: 10.1007/s43069-023-00214-7
Access Statistics for this article
SN Operations Research Forum is currently edited by Marco Lübbecke
More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().