[article]
Titre : |
Algorithm for long - term scheduling of multiproduct pipelines |
Type de document : |
texte imprimé |
Auteurs : |
S. A. MirHassani, Auteur ; S. Moradi, Auteur ; N. Taghinezhad, Auteur |
Année de publication : |
2012 |
Article en page(s) : |
pp. 13899–13910 |
Note générale : |
Chimie industrielle |
Langues : |
Anglais (eng) |
Mots-clés : |
Multiproduct Pipelines |
Résumé : |
In this article a mixed integer linear programming (MILP) model is presented for scheduling a multiproduct oil pipeline that connects a refinery to a few distribution centers. The scheduling task was carried out while considering a number of aspects such as satisfying daily demand, forcing settling periods for quality control, observing prespecified shutdown periods, and calculating batch size by considering the type of product. Finally, an approach to solve the model in long-term planning is proposed. The algorithm is able to achieve a near-optimal solution in reasonable running time. |
DEWEY : |
660 |
ISSN : |
0888-5885 |
En ligne : |
http://pubs.acs.org/doi/abs/10.1021/ie200101a |
in Industrial & engineering chemistry research > Vol. 50 N° 24 (Décembre 2011) . - pp. 13899–13910
[article] Algorithm for long - term scheduling of multiproduct pipelines [texte imprimé] / S. A. MirHassani, Auteur ; S. Moradi, Auteur ; N. Taghinezhad, Auteur . - 2012 . - pp. 13899–13910. Chimie industrielle Langues : Anglais ( eng) in Industrial & engineering chemistry research > Vol. 50 N° 24 (Décembre 2011) . - pp. 13899–13910
Mots-clés : |
Multiproduct Pipelines |
Résumé : |
In this article a mixed integer linear programming (MILP) model is presented for scheduling a multiproduct oil pipeline that connects a refinery to a few distribution centers. The scheduling task was carried out while considering a number of aspects such as satisfying daily demand, forcing settling periods for quality control, observing prespecified shutdown periods, and calculating batch size by considering the type of product. Finally, an approach to solve the model in long-term planning is proposed. The algorithm is able to achieve a near-optimal solution in reasonable running time. |
DEWEY : |
660 |
ISSN : |
0888-5885 |
En ligne : |
http://pubs.acs.org/doi/abs/10.1021/ie200101a |
|