Abstract: Because there is an analogous structure between the distillation separation sequence and the binary tree,the distillation separation sequence can be described as a binary tree data structure, and then, by using the method of graph theory, the change mechanism of neighboring split position in binary tree is built, as a result,a kind of effective evolutional neighborhood structure has been constructed.Adaptive mechanism and parallel technology are introduced into tabu search algorithm.This means that according to memorial 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 assignment.The numeric experiment shows that the adaptive and parallel tabu search can solve successfully large-scale distillation separation sequence synthesis problem.

摘要： 由于精馏分离序列与二叉树之间具有同构性，在数据结构上精馏分离序列可以抽象为二叉树.采用图论方法建立了二叉树相邻切分点变换机制，进而形成有效的邻域结构.将自适应机制和并行技术引入禁忌搜索算法中，根据记忆频率信息自适应调整禁忌长度与候选集规模，通过搜索任务分配安排形成多任务并行处理.数值实验表明自适应并行禁忌搜索算法能够成功解算大规模精馏分离序列优化综合问题.