Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems
چکیده
چکیدهای برای این سند ثبت نشده است.
چکیدهای برای این سند ثبت نشده است.
This paper presents a new algorithm for solving mixed integer nonlinear programming problems. The algorithm uses a branch and bound strategy where a nonlinear programming problem is solved in each integer node of the tree. The nonlinear programming problems, at each integer node
This special class of a nonlinear mathematical programming problem which is addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing
The open-pit mine production scheduling problem has received a great deal of attention in recent years, both in the academic literature, and in the mining industry. Optimization approaches to strategic planning for mine exploitation have become the industry standard, as the recen
This paper deals with the development of an efficient hybrid approach based on genetic algorithm and particle swarm optimization for solving mixed integer nonlinear reliability optimization problems in series, series–parallel and bridge systems. This approach maximizes the overal