Abstract
A large-scale machine system often has a general hierarchical structure. For hierarchical structures, optimization is difficult because many local optima exist in the hierarchical optimization problem, however genetic algorithms that have a hierarchical genotype can be applied to treat such problems directly. Relations between the structural components are analyzed and this information used to divide the hierarchical structure. Dividing large-scale problems into sub-problems that can be solved using parallel processed GAs increases the efficiency of the optimization search. The optimization of the large-scale system then becomes possible due to information sharing concerning Pareto optimum solutions for the sub-problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
