Dynamic optimisation of chemical engineering processes using the bees algorithm

Duc Pham, QT Pham, A Ghanbarzdaeh, Marco Castellani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)


An improved version of the Bees Algorithm is proposed for solving dynamic optimisation problems. This new formulation of the Bees Algorithm includes new search operators, and a new selection procedure that enhances the survival probability of newly formed individuals. The proposed algorithm is tested on six benchmark dynamic optimisation problems. The benchmark problems include minimisation and maximisation tasks of different levels of complexity. For all the problems, the Bees Algorithm finds very satisfactory optima. The very small standard deviation of the results proves the high reliability of the proposed technique. Experimental tests show that the Bees Algorithm outperforms the state-of-the-art Ant Colony Optimisation algorithm. The Bees Algorithm improves also the best results published in the literature for the six benchmark problems.
Original languageEnglish
Title of host publicationProceedings of the 17th World Congress
Subtitle of host publicationThe International Federation of Automatic Control
PublisherInternational Federation of Automatic Control
Publication statusPublished - 1 Jul 2008
Event17th IFAC World Congress - Seoul, Korea, Republic of
Duration: 6 Jul 200811 Jul 2008


Conference17th IFAC World Congress
Country/TerritoryKorea, Republic of


Dive into the research topics of 'Dynamic optimisation of chemical engineering processes using the bees algorithm'. Together they form a unique fingerprint.

Cite this