By Topic

Refinery Scheduling Optimization using Genetic Algorithms and Cooperative Coevolution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Leonardo M. Simao ; Chemtech - A Siemens Company, Rua da Quitanda, 50/21°. andar, Centro, Rio de Janeiro, RJ, Brasil, 20011-030. e-mail:, ; Douglas M. Dias ; Marco Aur lio C. Pacheco

Oil refineries are one of the most important examples of multiproduct continuous plants, that is, a continuous processing system that generates a number of products simultaneously. A refinery processes various crude oil types and produces a wide range of products. It is a complex optimization problem, mainly due to the number of different tasks involved and different objective criteria. In addition, some of the tasks have precedence constraints that require other tasks to be scheduled first. In this paper the refinery scheduling problem is addressed using genetic algorithms and cooperative coevolution. A simple refinery, with commonly found types of equipments, tasks and constraints of a real refinery, was created. Three test scenarios were designed with different sizes, demands and constraints. In all of them, the results obtained were far better than the ones obtained through random search

Published in:

2007 IEEE Symposium on Computational Intelligence in Scheduling

Date of Conference:

1-5 April 2007