Simplex genetic algorithm hybrid

John Yen, Bogju Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

29 Citations (Scopus)

Abstract

One of the main obstacles in applying genetic algorithms (GAs) to complex problems has been the high computational cost due to their slow convergence rate. To alleviate this difficulty, we developed a hybrid approach that combines GA with a stochastic variant of the simplex method in function optimization. Our motivation for developing the stochastic simplex method is to introduce a cost-effective exploration component into the conventional simplex method. In an attempt to make effective use of the simplex operation in a hybrid GA framework, we used an elite-based hybrid architecture that applies one simplex step to a top portion of the ranked population. We compared our approach with five alternative optimization techniques including a simplex-GA hybrid independently developed by Renders and Bersini and Adaptive Simulated Annealing (ASA). We used two function optimization problems to compare our approach with the five alternative methods. Overall, these tests showed that our hybrid approach is an effective and robust optimization technique. We also tested our hybrid GA on the seven function benchmark problems on real space and showed the results.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Conference on Evolutionary Computation, ICEC
Editors Anon
PublisherIEEE
Pages175-180
Number of pages6
StatePublished - 1997
EventProceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97 - Indianapolis, IN, USA
Duration: Apr 13 1997Apr 16 1997

Other

OtherProceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97
CityIndianapolis, IN, USA
Period4/13/974/16/97

Fingerprint

Genetic algorithms
Simulated annealing
Costs

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Cite this

Yen, J., & Lee, B. (1997). Simplex genetic algorithm hybrid. In Anon (Ed.), Proceedings of the IEEE Conference on Evolutionary Computation, ICEC (pp. 175-180). IEEE.
Yen, John ; Lee, Bogju. / Simplex genetic algorithm hybrid. Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. editor / Anon. IEEE, 1997. pp. 175-180
@inproceedings{3362ab971c4c4f539ad1f4d8e00a56fa,
title = "Simplex genetic algorithm hybrid",
abstract = "One of the main obstacles in applying genetic algorithms (GAs) to complex problems has been the high computational cost due to their slow convergence rate. To alleviate this difficulty, we developed a hybrid approach that combines GA with a stochastic variant of the simplex method in function optimization. Our motivation for developing the stochastic simplex method is to introduce a cost-effective exploration component into the conventional simplex method. In an attempt to make effective use of the simplex operation in a hybrid GA framework, we used an elite-based hybrid architecture that applies one simplex step to a top portion of the ranked population. We compared our approach with five alternative optimization techniques including a simplex-GA hybrid independently developed by Renders and Bersini and Adaptive Simulated Annealing (ASA). We used two function optimization problems to compare our approach with the five alternative methods. Overall, these tests showed that our hybrid approach is an effective and robust optimization technique. We also tested our hybrid GA on the seven function benchmark problems on real space and showed the results.",
author = "John Yen and Bogju Lee",
year = "1997",
language = "English (US)",
pages = "175--180",
editor = "Anon",
booktitle = "Proceedings of the IEEE Conference on Evolutionary Computation, ICEC",
publisher = "IEEE",

}

Yen, J & Lee, B 1997, Simplex genetic algorithm hybrid. in Anon (ed.), Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. IEEE, pp. 175-180, Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, ICEC'97, Indianapolis, IN, USA, 4/13/97.

Simplex genetic algorithm hybrid. / Yen, John; Lee, Bogju.

Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. ed. / Anon. IEEE, 1997. p. 175-180.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Simplex genetic algorithm hybrid

AU - Yen, John

AU - Lee, Bogju

PY - 1997

Y1 - 1997

N2 - One of the main obstacles in applying genetic algorithms (GAs) to complex problems has been the high computational cost due to their slow convergence rate. To alleviate this difficulty, we developed a hybrid approach that combines GA with a stochastic variant of the simplex method in function optimization. Our motivation for developing the stochastic simplex method is to introduce a cost-effective exploration component into the conventional simplex method. In an attempt to make effective use of the simplex operation in a hybrid GA framework, we used an elite-based hybrid architecture that applies one simplex step to a top portion of the ranked population. We compared our approach with five alternative optimization techniques including a simplex-GA hybrid independently developed by Renders and Bersini and Adaptive Simulated Annealing (ASA). We used two function optimization problems to compare our approach with the five alternative methods. Overall, these tests showed that our hybrid approach is an effective and robust optimization technique. We also tested our hybrid GA on the seven function benchmark problems on real space and showed the results.

AB - One of the main obstacles in applying genetic algorithms (GAs) to complex problems has been the high computational cost due to their slow convergence rate. To alleviate this difficulty, we developed a hybrid approach that combines GA with a stochastic variant of the simplex method in function optimization. Our motivation for developing the stochastic simplex method is to introduce a cost-effective exploration component into the conventional simplex method. In an attempt to make effective use of the simplex operation in a hybrid GA framework, we used an elite-based hybrid architecture that applies one simplex step to a top portion of the ranked population. We compared our approach with five alternative optimization techniques including a simplex-GA hybrid independently developed by Renders and Bersini and Adaptive Simulated Annealing (ASA). We used two function optimization problems to compare our approach with the five alternative methods. Overall, these tests showed that our hybrid approach is an effective and robust optimization technique. We also tested our hybrid GA on the seven function benchmark problems on real space and showed the results.

UR - http://www.scopus.com/inward/record.url?scp=0030646625&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030646625&partnerID=8YFLogxK

M3 - Conference contribution

SP - 175

EP - 180

BT - Proceedings of the IEEE Conference on Evolutionary Computation, ICEC

A2 - Anon, null

PB - IEEE

ER -

Yen J, Lee B. Simplex genetic algorithm hybrid. In Anon, editor, Proceedings of the IEEE Conference on Evolutionary Computation, ICEC. IEEE. 1997. p. 175-180