Abstract

Both Genetic Algorithm (GA) and Linear Programming (LP) are effective optimization algorithms. LP is very efficient for optimizing linear problems. GA can attain very good solutions for integer non-linear problems, but it takes more time. To solve the very complex nested optimization problems, we propose a hybrid algorithm to combine the merits from both LP and GA algorithms in this paper. We use GA to optimize the parent problem, and LP/GA hybrid algorithm to solve the sub problem. The Stock Reduction Problem (SRP) is a typical example of complex nested optimization problems. Our experiments have shown that our new hybrid algorithm can solve the SRP very fast with excellent results.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.