Hierarchical genetic algorithm

Kumar R., K. Izui, M. Yoshimura, and S. Nishiwaki, 2008, Multilevel redtmdancy allocation optimization using hierarchical genetic algorithm , IEEE Trans. Reliability, vol. 57, no. 4, pp. 650-661. 

Jones, G., A. M. Robertson, C. Santimetvirul, and P. Willett. 1995. Non-hierarchic document clustering using a genetic algorithm. Information Research 1(1). Available at http //InformationR.net/ir/1- 1/paperl.html... 

An interesting data structure, called flexibility tree, can be employed in the search for the docked complex structure and it allows to combine several flexibility techniques [95]. The data structure hierarchically encodes the flexibility of a protein in variables that allow several protein parts to experience different kinds of moves. Flexibility of domains may be described via normal mode or hinge motions, and side chains are allowed to explore rotameric states. Flexibility trees for protein and ligand are implemented in Flip Dock that provides a genetic algorithm to optimize the variables to gain an induced fit complex ]96]. 

Solution method refers to the method applied to solve the proposed model e.g. (commercial) standard solvers [standard] (such as CPLEX or CONOPT), a specific optimization method [specific], a hierarchical decomposition approach [decomp.j, or a heuristioal procedure [heur.]. For simulation models, often a finite set of scenarios is evaluated and compared [seen.]. But also genetic algorithms are sometimes used for simulation optimzation [GA]. ... 

---