.png){kind=icon}
.png){kind=icon}
Return
Similarity and Logic Gate-Based Tree-Seed Algorithms for Binary Optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2017.12.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper focuses on solving binary optimization problems by using Tree-Seed Algorithm, TSA for short. While TSA is firstly proposed for solving optimization problems with continuously-structured solution space, TSA is modified to solve binary optimization problems, which is a subfield of discrete optimization, by using logic gates (LogicTSA) and similarity measurement techniques (SimTSA). In order to improve performance of these methods, a hybrid variant (SimLogicTSA) is also proposed. The performance of the proposed algorithms is investigated on uncapacitated facility location problems (UFLPs), which are pure binary optimization problems. The experimental results on 15 test instances are compared with each other and state-of-art algorithms. The comparisons demonstrate that hybrid variant of the algorithm is better than the other variants of the algorithm and state-of-art algorithms in terms of solution quality and robustness.
Keywords:
Binary optimization
Tree-seed algorithm
Similarity
Logic gate
Location analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W