2005
DOI: 10.1016/j.parco.2005.03.006
|View full text |Cite
|
Sign up to set email alerts
|

Development of a parallel optimization method based on genetic simulated annealing algorithm

Abstract: Abstract. This paper presents a parallel genetic simulated annealing (PGSA) algorithm that has been developed and applied to optimize continuous problems. In PGSA, the entire population is divided into subpopulations, and in each subpopulation the algorithm uses the local search ability of simulated annealing after crossover and mutation. The best individuals of each subpopulation are migrated to neighboring ones after certain number of epochs. An implementation of the algorithm is discussed and the performanc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
23
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(26 citation statements)
references
References 12 publications
0
23
0
Order By: Relevance
“…Genetic simulated annealing algorithm (GSA) is an optimization algorithm combining genetic algorithm with simulated annealing algorithm [22,23]. Supposing that initial characteristic vector is dimension, then individual length individual = .…”
Section: Feature Extraction Methods Based On Genetic Simulatedmentioning
confidence: 99%
“…Genetic simulated annealing algorithm (GSA) is an optimization algorithm combining genetic algorithm with simulated annealing algorithm [22,23]. Supposing that initial characteristic vector is dimension, then individual length individual = .…”
Section: Feature Extraction Methods Based On Genetic Simulatedmentioning
confidence: 99%
“…2) Searching the approximate optimal solution with the simulatiom annealing algorithm [5,6] The Floyd [7] algorithm is used to solve the path and the shortest distance between any two location points in the figure after the group is solved. Accordingly, an equivalent network diagram is constructed with containing all customer location points.…”
Section: ) Grouping the Customers By Clustering Algorithm [4]mentioning
confidence: 99%
“…Distributed GA which depends less on objects and has high searching performance [37] is used for identification. The mode parameters are encoded into binary GA individuals.…”
Section: Identification Through Gamentioning
confidence: 99%