.png){kind=icon}
Return
Discrete state transition algorithm for unconstrained integer optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2015.08.041.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A recently new intelligent optimization algorithm called discrete state transition algorithm is considered in this study, for solving unconstrained integer optimization problems. Firstly, some key elements for discrete state transition algorithm are summarized to guide its well development. Several intelligent operators are designed for local exploitation and global exploration. Then, a dynamic adjustment strategy risk and restoration in probability is proposed to capture global solutions with high probability. Finally, numerical experiments are carried out to test the performance of the proposed algorithm compared with other heuristics, and they show that the similar intelligent operators can be applied to ranging from traveling salesman problem, boolean integer programming, to discrete value selection problem, which indicates the adaptability and flexibility of the proposed intelligent elements. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
State transition algorithm
Integer optimization
Traveling salesman problem
Maximum cut problem
Discrete value selection
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:
2.5W
Citations:
6.5W
Organization
Cited Papers
Genetic variation in vulnerability to the behavioral effects of neonatal hippocampal damage in rats.OAAI
OAAIShareSaveShareSaveShareSaveShareSave
ShareSaveInjury-Dependent and Disability-Specific Lumbar Spinal Gene Regulation following Sciatic Nerve Injury in the Rat.png)
PLOS ONEOAAI
PLOS ONEIF0
OAAIShareSave
View more