Ant colony framework for optimal design and scheduling of batch plants

被引：84

作者：

Jayaraman, VK ^{[1
]}

Kulkarni, BD ^{[1
]}

Karale, S ^{[1
]}

Shelokar, P ^{[1
]}

机构：

[1] Natl Chem Lab, Dept Chem Engn, Pune 411008, Maharashtra, India

来源：

COMPUTERS & CHEMICAL ENGINEERING | 2000年 / 24卷 / 08期

关键词：

ant colony optimisation paradigm; batch plants; optimal design;

D O I：

10.1016/S0098-1354(00)00592-5

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper presents a new co-operative search approach, the ant colony optimisation paradigm, for the optimal design of batch chemical processes and illustrates it by solving (1) the combinatorial optimisation problem of multiproduct batch scheduling and (2) the continuous function optimisation problem for the design of multiproduct batch plant with single product campaigns and horizon constraints. The ant algorithm is simple to implement and results of the case studies show its ability to provide speedy and accurate solutions. (C) 2000 Elsevier Science Ltd. All rights reserved.

引用

页码：1901 / 1912

页数：12

共 34 条

[31] DETERMINATION OF COMPLETION TIMES FOR SERIAL MULTIPRODUCT PROCESSES .3. MIXED INTERMEDIATE STORAGE-SYSTEMS [J].

WIEDE, W ;

REKLAITIS, GV .

COMPUTERS & CHEMICAL ENGINEERING, 1987, 11 (04) :357-368

[32] SOLUTION OF FLOWSHOP-SCHEDULING PROBLEM WITH NO INTERMEDIATE QUEUES [J].

WISMER, DA .

OPERATIONS RESEARCH, 1972, 20 (03) :689-&

[33]

Wodrich M, 1997, CONTROL CYBERN, V26, P413

[34]

Yu IK, 1998, POWERCON '98: 1998 INTERNATIONAL CONFERENCE ON POWER SYSTEM TECHNOLOGY - PROCEEDINGS, VOLS 1 AND 2, P552, DOI 10.1109/ICPST.1998.729025

← 1 2 3 4 →