Distillation separation sequence optimization synthesis based on application of adaptive parallel tabu search

Distillation separation sequences can be described as binary tree data structures, because of the analogous structures of distillation separation sequences and binary trees, and then by applying graph theory, the change mechanism of neighborhood separation points based on binary trees is built, corr...

Full description

Saved in:
Bibliographic Details
Published inJournal of the Chinese Institute of Engineers Vol. 28; no. 3; pp. 493 - 501
Main Authors Dong, Hong-Guang, Qin, Li-Min, Wang, Tao, Yao, Ping-Jing
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.05.2005
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Distillation separation sequences can be described as binary tree data structures, because of the analogous structures of distillation separation sequences and binary trees, and then by applying graph theory, the change mechanism of neighborhood separation points based on binary trees is built, correspondingly a kind of highly effective, evolutionary neighborhood structure is constructed. For the purpose of researching further tabu search algorithms, adaptive mechanisms and parallel techniques are introduced. That is, according to memory frequency information, the tabu length and the number of candidates are adaptively adjusted, and multitask parallel technology is realized through the arrangement of the search assignments. The example shows that adaptive parallel tabu searches can solve, successfully, large-scale distillation separation sequence synthesis problems.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0253-3839
2158-7299
DOI:10.1080/02533839.2005.9671015