2012
DOI: 10.1021/ie201283z
|View full text |Cite
|
Sign up to set email alerts
|

Large-Scale Refinery Crude Oil Scheduling by Integrating Graph Representation and Genetic Algorithm

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 enab… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0
1

Year Published

2014
2014
2020
2020

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 28 publications
(11 citation statements)
references
References 36 publications
0
10
0
1
Order By: Relevance
“…Among the various stochastic optimization methods, Genetic Algorithms (GAs) have been commonly used (Tsai and Chang, 2001;Prakotpol and Srinophakun, 2004;Lavric et al, 2005;Tudor and Lavric, 2010) although other techniques such as adaptive random search (Jeżowski et al, 2003;Poplewski and Jeżowski, 2007) have also been proposed. While GA is often computationally slower than deterministic methods and may not guarantee a global optima, they are more robust in the sense that they are able to handle discontinuous functions and obtain good quality solutions even for large-scale combinatorial problems within reasonable computational times (Ramteke and Srinivasan, 2012). Another advantage of GAs over deterministic methods is that GA techniques are inherently more suitable for multi-objective problems.…”
Section: Water Network Synthesis In Literaturementioning
confidence: 99%
See 2 more Smart Citations
“…Among the various stochastic optimization methods, Genetic Algorithms (GAs) have been commonly used (Tsai and Chang, 2001;Prakotpol and Srinophakun, 2004;Lavric et al, 2005;Tudor and Lavric, 2010) although other techniques such as adaptive random search (Jeżowski et al, 2003;Poplewski and Jeżowski, 2007) have also been proposed. While GA is often computationally slower than deterministic methods and may not guarantee a global optima, they are more robust in the sense that they are able to handle discontinuous functions and obtain good quality solutions even for large-scale combinatorial problems within reasonable computational times (Ramteke and Srinivasan, 2012). Another advantage of GAs over deterministic methods is that GA techniques are inherently more suitable for multi-objective problems.…”
Section: Water Network Synthesis In Literaturementioning
confidence: 99%
“…These chromosome values are then used to calculate the objective function(s) of the TWN problem. These objective function(s) are next converted to a fitness function which serves as an indicator of the suitability of each chromosome population as a solution to the problem (Ramteke and Srinivasan, 2012). Subsequently, these chromosome values are further assessed using the concept of non-domination for generating the next generation of chromosomes.…”
Section: Ga Formulation Of Twn Synthesis Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…As a category of stochastic optimization algorithms, meta-heuristics are effective for problems with large search space and can obtain satisfactory solutions within reasonable times. The popular metaheuristics include genetic algorithm, 37 particle swarm optimization (PSO), 38 ant colony optimization, 39 cuckoo search algorithm, 40 etc. However, meta-heuristics cannot guarantee the quality of final solutions obtained and have difficulty in representing complex constraints to find feasible solutions.…”
Section: Introductionmentioning
confidence: 99%
“…Estudos foram e continuam sendo realizados utilizando a técnica de algoritmos genéticos (AG) para otimização da atividade de programação da produção [3,8,9,10]. Entretanto, um fator representa um desafio sobre essa modelagem: a complexidade do problema, que implica em indivíduos (cromossomos) de tamanho muito grande cuja representação compromete o desempenho do sistema.…”
Section: Motivaçãounclassified