Composite laminate configuration requires discrete programming to locate the right number of handles with thicknesses, angular orientation, and material sorts, which are typically confined to a discrete arrangement of genes. Genetic algorithms (GA's) are one of only a handful couple of streamlining instruments accessible that are appropriate to such discrete critical thinking situations. The fundamental objective of this work is to consider the GA's capacity to be effectively adjusted to various kinds of composite laminate structure streamlining issues. Two distinct variants of a genetic algorithm, GA-I and GA-II, were grown explicitly to achieve these errands. To exhibit the adaptability of the GA structure, the GA-II algorithm was conceived to deal with increasingly complex composite laminate designs developed from numerous materials. The changed GA used two chromosome strings to speak to the composite laminate. The main string characterized the introduction point of every lamina, and the second string characterized a lamina's material kind. By utilizing two diverse chromosome strings, just little adjustments to the different genetic administrators were required. The streamlining definition was done by deciding separate expense and weight target capacities. A raised mix of these two goals was utilized for laminate wellness, and in this manner required no extra adjustments to the GA. The target of this paper is to devise a genetic algorithm for stacking succession structure of symmetrically laminated composite plates. Stacking succession configuration infers the assurance of the quantity of employs in the laminate just as their introduction. With this component, the GA might be utilized to control laminate weight by changing the quantity of handles in the laminate stacking succession. The genetic algorithm will not be permitted to change the dimensional components of the plate all through the improvement procedure. Two distinct forms of a genetic algorithm are investigated.