Please use this identifier to cite or link to this item:
|Title:||Large-scale refinery crude oil scheduling by integrating graph representation and genetic algorithm|
|Citation:||Ramteke, M., Srinivasan, R. (2012-04-11). Large-scale refinery crude oil scheduling by integrating graph representation and genetic algorithm. Industrial and Engineering Chemistry Research 51 (14) : 5256-5272. ScholarBank@NUS Repository. https://doi.org/10.1021/ie201283z|
|Abstract:||Scheduling is widely studied in process systems engineering and is typically solved using mathematical programming. Although popular for many other optimization problems, evolutionary algorithms have not found wide applicability in such combinatorial optimization problems with large numbers of variables and constraints. Here we demonstrate that scheduling problems that involve a process network of units and streams have a graph structure which can be exploited to offer a sparse problem representation that enables efficient stochastic optimization. In the proposed structure adapted genetic algorithm, SAGA, only the subgraph of the process network that is active in any period is explicitly represented in the chromosome. This leads to a significant reduction in the representation, but additionally, most constraints can be enforced without the need for a penalty function. The resulting benefits in terms of improved search quality and computational performance are established by studying 24 different crude oil operations scheduling problems from the literature. © 2012 American Chemical Society.|
|Source Title:||Industrial and Engineering Chemistry Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 23, 2019
WEB OF SCIENCETM
checked on Mar 13, 2019
checked on Jan 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.