Hybridized neural network and genetic algorithms for solving nonlinear integer programming problem

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Optimization problems such as system reliability design and general assignment problem are generally formulated as a nonlinear integer programming (NIP) problem. Generally, we transform the nonlinear integer programming problem into a linear programming one in order to solve NIP problems. However linear programming problems transformed from NIP problems become a large-scale problem. In principal, it is de- sired that we deal with the NIP problems without any transformation. In this paper, we propose a new method in which a neural network technique is hybridized with genetic algorithms for solving nonlinear integer programming problems. The hybrid GA is employed the simpelx search method, and the chromosomes are improved to good points by using the simplex search method. The effectiveness and effciency of this approach are shown with numerical simulations from the reliability optimal design problem.

Cite

CITATION STYLE

APA

Gen, M., Ida, K., & Lee, C. Y. (1999). Hybridized neural network and genetic algorithms for solving nonlinear integer programming problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1585, pp. 421–429). Springer Verlag. https://doi.org/10.1007/3-540-48873-1_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free