State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems

A simulated annealing (SA) algorithm is an effective method for solving optimization problems, especially for combinatorial optimization problems. However, SA algorithms rely heavily on the iterative mechanism of the neighborhood structure. When the scale of the problem becomes larger, the convergen...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE access Jg. 7; S. 44391 - 44403
Hauptverfasser:	Han, Xiaoxia, Dong, Yingchao, Yue, Lin, Xu, Quanxi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Combinatorial analysis combinatorial optimization Continuous annealing continuous optimization problem Convergence Genetic algorithms Heuristic algorithms Operators (mathematics) Optimization Search problems Simulated annealing simulated annealing algorithm State transition Traveling salesman problem
ISSN:	2169-3536, 2169-3536
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!