A SOLVING FOR AN OPTIMAL LOADED-ALLOCATION PROBLEM OF SIMPLE BEAM

The design of machines is always done based on the experience obtained by trail and error methods. In this paper, we propose a method of sol ving an optimal loaded-allocation (OLA) problem of simple beam which i s fundamental for the strength factor in design. This model is allocat ion problem of concentrated load and distributed load for maximized ob jective function with a nonlinear loaded constraint on the support poi nt. In general, it is difficult to directly solve many optimization pr oblems formulated as nonlinear integer programming(NIP)model. The appl ication of a genetic algorithm(GA) (that uses the stochastic search me thod) effectively solves the combinatorial problem making it a remarka ble new tool for solving any kind of problem. In this paper, we formul ate an OLA problem of a simple beam with the concentrated load, distri buted load or a combination of both, as a NIP problem and solve it dir ectly by keeping the nonlinear load constraint for support point by us ing improved GA. We discuss the efficiency of the propose method.