An evolutionary linear programming algorithm for solving the stock reduction problem
by Gang Shen; Yan-Qing Zhang
International Journal of Computer Applications in Technology (IJCAT), Vol. 44, No. 3, 2012

Abstract: It is very difficult to solve complex nested optimisation problems (optimising both parent and child problems at the same time). In this paper, we propose an evolutionary linear programming algorithm that combines Linear Programming (LP) and Genetic Algorithm (GA) to solve them. GA is used to optimise the parent problem, and the LP/GA hybrid algorithm is used to solve the sub-problem. The stock reduction problem (SRP) is a typical nested optimisation problem. The parent is a minimising stock mix problem (MSMP), and the child is a cutting stock problem (CSP). Simulation results have shown that our new hybrid algorithm can solve complex SRPs with high efficiency and accuracy. This new hybrid algorithm can be used in many other applications where integer and non-integer optimisation problems interact with each other, such as airline scheduling, shipping scheduling, etc.

Online publication date: Wed, 12-Sep-2012

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com