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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have