A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling
Identifieur interne : 000662 ( France/Analysis ); précédent : 000661; suivant : 000663A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling
Auteurs : Sylvain Mouret [États-Unis] ; Ignacio E. Grossmann [États-Unis] ; Pierre Pestiaux [France]Source :
- Computers & chemical engineering [ 0098-1354 ] ; 2011.
Descripteurs français
- Pascal (Inist)
- Lagrangien, Intégration, Ordonnancement, Gestion production, Raffinerie, Echelle grande, Programmation partiellement en nombres entiers, Programmation en nombres entiers, Programmation non linéaire, Industrie pétrolière, Multiplicateur Lagrange, Méthode plan sécant, Optimisation sousgradient, Norme, Planification, Effet non linéaire, Méthode décomposition, Résolution problème, Etude cas.
- Wicri :
- topic : Industrie pétrolière, Norme.
English descriptors
- KwdEn :
- Case study, Cutting plane method, Decomposition method, Integer programming, Integration, Lagrange multiplier, Lagrangian, Large scale, Mixed integer programming, Non linear effect, Non linear programming, Oil industry, Planning, Problem solving, Production management, Refinery, Scheduling, Standards, Subgradient optimization.
Abstract
The aim of this paper is to introduce a methodology to solve a large-scale mixed-integer nonlinear program (MINLP) integrating the two main optimization problems appearing in the oil refining industry: refinery planning and crude-oil operations scheduling. The proposed approach consists of using Lagrangian decomposition to efficiently integrate both problems. The main advantage of this technique is to solve each problem separately. A new hybrid dual problem is introduced to update the Lagrange multipliers. It uses the classical concepts of cutting planes, subgradient, and boxstep. The proposed approach is compared to a basic sequential approach and to standard MINLP solvers. The results obtained on a case study and a larger refinery problem show that the new Lagrangian decomposition algorithm is more robust than the other approaches and produces better solutions in reasonable times.
Affiliations:
- France, États-Unis
- Haute-Normandie, Pennsylvanie, Région Normandie
- Harfleur, Pittsburgh
- Université Carnegie-Mellon
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 004E42
- to stream PascalFrancis, to step Curation: 000048
- to stream PascalFrancis, to step Checkpoint: 004543
- to stream Main, to step Merge: 00AA57
- to stream Main, to step Curation: 00A307
- to stream Main, to step Exploration: 00A307
- to stream France, to step Extraction: 000662
Links to Exploration step
Pascal:12-0010769Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling</title>
<author><name sortKey="Mouret, Sylvain" sort="Mouret, Sylvain" uniqKey="Mouret S" first="Sylvain" last="Mouret">Sylvain Mouret</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Chemical Engineering, Carnegie Mellon University</s1>
<s2>Pittsburgh, PA, 15213</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<placeName><settlement type="city">Pittsburgh</settlement>
<region type="state">Pennsylvanie</region>
</placeName>
<orgName type="university">Université Carnegie-Mellon</orgName>
</affiliation>
</author>
<author><name sortKey="Grossmann, Ignacio E" sort="Grossmann, Ignacio E" uniqKey="Grossmann I" first="Ignacio E." last="Grossmann">Ignacio E. Grossmann</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Chemical Engineering, Carnegie Mellon University</s1>
<s2>Pittsburgh, PA, 15213</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<placeName><settlement type="city">Pittsburgh</settlement>
<region type="state">Pennsylvanie</region>
</placeName>
<orgName type="university">Université Carnegie-Mellon</orgName>
</affiliation>
</author>
<author><name sortKey="Pestiaux, Pierre" sort="Pestiaux, Pierre" uniqKey="Pestiaux P" first="Pierre" last="Pestiaux">Pierre Pestiaux</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>Total Refining & Marketing, Research Division</s1>
<s2>76700 Harfleur</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
<settlement type="city">Harfleur</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">12-0010769</idno>
<date when="2011">2011</date>
<idno type="stanalyst">PASCAL 12-0010769 INIST</idno>
<idno type="RBID">Pascal:12-0010769</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">004E42</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000048</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">004543</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">004543</idno>
<idno type="wicri:doubleKey">0098-1354:2011:Mouret S:a:new:lagrangian</idno>
<idno type="wicri:Area/Main/Merge">00AA57</idno>
<idno type="wicri:Area/Main/Curation">00A307</idno>
<idno type="wicri:Area/Main/Exploration">00A307</idno>
<idno type="wicri:Area/France/Extraction">000662</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling</title>
<author><name sortKey="Mouret, Sylvain" sort="Mouret, Sylvain" uniqKey="Mouret S" first="Sylvain" last="Mouret">Sylvain Mouret</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Chemical Engineering, Carnegie Mellon University</s1>
<s2>Pittsburgh, PA, 15213</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<placeName><settlement type="city">Pittsburgh</settlement>
<region type="state">Pennsylvanie</region>
</placeName>
<orgName type="university">Université Carnegie-Mellon</orgName>
</affiliation>
</author>
<author><name sortKey="Grossmann, Ignacio E" sort="Grossmann, Ignacio E" uniqKey="Grossmann I" first="Ignacio E." last="Grossmann">Ignacio E. Grossmann</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Chemical Engineering, Carnegie Mellon University</s1>
<s2>Pittsburgh, PA, 15213</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<placeName><settlement type="city">Pittsburgh</settlement>
<region type="state">Pennsylvanie</region>
</placeName>
<orgName type="university">Université Carnegie-Mellon</orgName>
</affiliation>
</author>
<author><name sortKey="Pestiaux, Pierre" sort="Pestiaux, Pierre" uniqKey="Pestiaux P" first="Pierre" last="Pestiaux">Pierre Pestiaux</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>Total Refining & Marketing, Research Division</s1>
<s2>76700 Harfleur</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
<settlement type="city">Harfleur</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Computers & chemical engineering</title>
<title level="j" type="abbreviated">Comput. chem. eng.</title>
<idno type="ISSN">0098-1354</idno>
<imprint><date when="2011">2011</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Computers & chemical engineering</title>
<title level="j" type="abbreviated">Comput. chem. eng.</title>
<idno type="ISSN">0098-1354</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Case study</term>
<term>Cutting plane method</term>
<term>Decomposition method</term>
<term>Integer programming</term>
<term>Integration</term>
<term>Lagrange multiplier</term>
<term>Lagrangian</term>
<term>Large scale</term>
<term>Mixed integer programming</term>
<term>Non linear effect</term>
<term>Non linear programming</term>
<term>Oil industry</term>
<term>Planning</term>
<term>Problem solving</term>
<term>Production management</term>
<term>Refinery</term>
<term>Scheduling</term>
<term>Standards</term>
<term>Subgradient optimization</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Lagrangien</term>
<term>Intégration</term>
<term>Ordonnancement</term>
<term>Gestion production</term>
<term>Raffinerie</term>
<term>Echelle grande</term>
<term>Programmation partiellement en nombres entiers</term>
<term>Programmation en nombres entiers</term>
<term>Programmation non linéaire</term>
<term>Industrie pétrolière</term>
<term>Multiplicateur Lagrange</term>
<term>Méthode plan sécant</term>
<term>Optimisation sousgradient</term>
<term>Norme</term>
<term>Planification</term>
<term>Effet non linéaire</term>
<term>Méthode décomposition</term>
<term>Résolution problème</term>
<term>Etude cas</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Industrie pétrolière</term>
<term>Norme</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The aim of this paper is to introduce a methodology to solve a large-scale mixed-integer nonlinear program (MINLP) integrating the two main optimization problems appearing in the oil refining industry: refinery planning and crude-oil operations scheduling. The proposed approach consists of using Lagrangian decomposition to efficiently integrate both problems. The main advantage of this technique is to solve each problem separately. A new hybrid dual problem is introduced to update the Lagrange multipliers. It uses the classical concepts of cutting planes, subgradient, and boxstep. The proposed approach is compared to a basic sequential approach and to standard MINLP solvers. The results obtained on a case study and a larger refinery problem show that the new Lagrangian decomposition algorithm is more robust than the other approaches and produces better solutions in reasonable times.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
<li>États-Unis</li>
</country>
<region><li>Haute-Normandie</li>
<li>Pennsylvanie</li>
<li>Région Normandie</li>
</region>
<settlement><li>Harfleur</li>
<li>Pittsburgh</li>
</settlement>
<orgName><li>Université Carnegie-Mellon</li>
</orgName>
</list>
<tree><country name="États-Unis"><region name="Pennsylvanie"><name sortKey="Mouret, Sylvain" sort="Mouret, Sylvain" uniqKey="Mouret S" first="Sylvain" last="Mouret">Sylvain Mouret</name>
</region>
<name sortKey="Grossmann, Ignacio E" sort="Grossmann, Ignacio E" uniqKey="Grossmann I" first="Ignacio E." last="Grossmann">Ignacio E. Grossmann</name>
</country>
<country name="France"><region name="Région Normandie"><name sortKey="Pestiaux, Pierre" sort="Pestiaux, Pierre" uniqKey="Pestiaux P" first="Pierre" last="Pestiaux">Pierre Pestiaux</name>
</region>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Amérique/explor/PittsburghV1/Data/France/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000662 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000662 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Amérique |area= PittsburghV1 |flux= France |étape= Analysis |type= RBID |clé= Pascal:12-0010769 |texte= A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling }}
This area was generated with Dilib version V0.6.38. |