Quantum Evolutionary Algorithm for Chemical Batch Scheduling Problem

Article Preview

Abstract:

This paper presents an improved particle swarm optimization combined with quantum evolutionary algorithm (QAE). In the algorithm, continuous coding represents weight information of the batches’ sequence to enhance the ability of handling the constraints. The batch separation strategy unifies the relationship of scheduling time into minimum time span between batches and brings about the feasible processing sequence. Scheduling generation and repair strategies are proposed to obtain feasible solutions. In order to verify the performance of the QAE algorithm, the well-know benchmark scheduling instances are tested. The computational results show that the QAE may find optimal or suboptimal solutions in a short run time for all the instances.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

506-509

Citation:

Online since:

October 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] C.T. Maravelias, I.E. Grossmann: Industral and Engineering Chemistry Research Vol. 42(13) (2003), pp.3056-3074.

Google Scholar

[2] M.A. Shaik, C.A. Floudas: Computers and Chemical Engineering Vol. 32(2008), pp.260-274.

Google Scholar

[3] J. Chen, G. Steiner: European Journal of Operational Research Vol. 96(1996), pp.591-611.

Google Scholar

[4] A. Sundaramoorthy, I.A. Karimi: Chemical Engineering Science Vol. 60(10)(2005), pp.2679-2702.

Google Scholar

[5] Y. Liu, I.A. Karimi: Chemical Engineering Science Vol. 62(2007), pp.1549-1566.

Google Scholar