By Topic

Solving the Stock Reduction Problem with the Genetic Linear Programming Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gang Shen ; Dept. of Comput. Sci., Georgia State Univ., Atlanta, GA, USA ; Yan-Qing Zhang

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.

Published in:

Computational and Information Sciences (ICCIS), 2010 International Conference on

Date of Conference:

17-19 Dec. 2010