The full text of this article


Hybrid multi-objective differential evolution (H-MODE) for optimisation of polyethylene terephthalate (PET) reactor
by Ashish M. Gujarathi, B.V. Babu
International Journal of Bio-Inspired Computation (IJBIC), Vol. 2, No. 3/4, 2010


Abstract: Multi-objective evolutionary algorithms (MOEAs) are used to solve the optimisation problems with more than one objective to be optimised simultaneously having conflict among each other. Due to the limitations of traditional deterministic algorithms to handle complex and nonlinear search space, several EAs are developed in the recent past. The multi-objective differential evolution (MODE) algorithm is already tested and found to be a reliable algorithm due to their ability to handle non-linear problems efficiently. Though MODE is accurate in terms of converging to the global Pareto front, traditional method has their advantage in terms of speed. We combined these two algorithms and developed hybrid strategy of MODE thus, achieving both accuracy and speed. Hybrid MODE (H-MODE) algorithm is applied on multi-objective optimisation of industrial wiped film polyethylene terephthalate reactor. The results of the present study are compared with those obtained using MODE algorithm. Smooth and well diverse Pareto optimal front is observed with a much faster speed using H-MODE.

Online publication date: Fri, 07-May-2010


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 Bio-Inspired Computation (IJBIC):
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