For several years, adaptive range genetic algorithms have been developed and it turned out to be very efficient in treatment of both discrete variables and continuous variables. That means it is useful tools for mixed variable problem, which was thought most daunting problem in design engineering. We have shown its effectiveness through benchmark problems and outperformed the other method in its accuracy. In this paper, we will newly develop a new type of Adaptive Range Genetic Algorithms, which will consider inheritance of searching range. We have demonstrated its effectiveness through benchmark problem and showed its characters. Through numerical example, we showed the stability and effectiveness of the proposed method compared with the conventional method.
- Design Engineering Division and Computers and Information in Engineering Division
Development of Adaptive Range Genetic Algorithms Considering Inheritance of Searching Range
- Views Icon Views
- Share Icon Share
- Search Site
Arakawa, M, & Ishikawa, H. "Development of Adaptive Range Genetic Algorithms Considering Inheritance of Searching Range." Proceedings of the ASME 2002 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. Volume 2: 28th Design Automation Conference. Montreal, Quebec, Canada. September 29–October 2, 2002. pp. 655-661. ASME. https://doi.org/10.1115/DETC2002/DAC-34103
Download citation file: